Pregled bibliografske jedinice broj: 559481
Variable Neighborhood Search for Extremal Graphs. 24. Results about the clique number
Variable Neighborhood Search for Extremal Graphs. 24. Results about the clique number // Studia informatica Universalis, 8 (2010), 281-316 (podatak o recenziji nije dostupan, članak, znanstveni)
CROSBI ID: 559481 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Variable Neighborhood Search for Extremal Graphs. 24. Results about the clique number
Autori
Sedlar, Jelena ; Vukičević, Damir ; Mustapha Aouchiche ; Hansen, Piere
Izvornik
Studia informatica Universalis (1625-7545) 8
(2010);
281-316
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
extremal graphs; clique number
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Kemija
POVEZANOST RADA
Projekti:
037-0000000-2779 - Diskretna matematika i primjene (Svrtan, Dragutin, MZOS ) ( CroRIS)
177-0000000-0884 - Diskretni matematički modeli u kemiji (Vukičević, Damir, MZOS ) ( CroRIS)
Ustanove:
Prirodoslovno-matematički fakultet, Split
Profili:
Damir Vukičević
(autor)
