Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Variable Neighborhood Search for Extremal Graphs. 24. Results about the clique number (CROSBI ID 179842)

Prilog u časopisu | izvorni znanstveni rad

Sedlar, Jelena ; Vukičević, Damir ; Mustapha Aouchiche ; Hansen, Piere Variable Neighborhood Search for Extremal Graphs. 24. Results about the clique number // Studia informatica Universalis, 8 (2010), 281-316

Podaci o odgovornosti

Sedlar, Jelena ; Vukičević, Damir ; Mustapha Aouchiche ; Hansen, Piere

engleski

Variable Neighborhood Search for Extremal Graphs. 24. Results about the clique number

A set of vertices S in a graph G is a clique if any two of its vertices are adjacent. The clique number ! is the maximum cardinality of a clique in G. A series of best possible lower and upper bounds on the di erence, sum, ratio or product of ! and some other common invariants of G were obtained by the system AGX 2, and most of them proved either automatically or by hand. In the present paper, we report on such lower and upper bounds considering, as second invariant, minimum, average and maximum degree, algebraic, node and edge connectivity, index, average distance, remoteness, radius and diameter.

extremal graphs; clique number

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

8

2010.

281-316

objavljeno

1625-7545

2496-1477

Povezanost rada

Kemija, Matematika