crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 559481

Časopis

Autori: Sedlar, Jelena; Vukičević, Damir; Mustapha Aouchiche; Hansen, Piere
Naslov: Variable Neighborhood Search for Extremal Graphs. 24. Results about the clique number
( Variable Neighborhood Search for Extremal Graphs. 24. Results about the clique number )
Izvornik: Studia informatica Universalis (0000-0000) 8 (2010); 281-316
Vrsta rada: članak
Ključne riječi: extremal graphs; clique number
( 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.
Projekt / tema: 177-0000000-0884, 037-0000000-2779
Izvorni jezik: eng
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Kemija
URL cjelovitog teksta:
Časopis izlazi u samo elektroničkom izdanju: NE
Google Scholar: Variable Neighborhood Search for Extremal Graphs. 24. Results about the clique number
Upisao u CROSBI: vukicevi@pmfst.hr (vukicevi@pmfst.hr), 28. Stu. 2011. u 01:23 sati



Verzija za printanje   za tiskati


upomoc
foot_4