Pregled bibliografske jedinice broj: 854992
On Two Graffiti Conjectures about Fullerene Graphs
On Two Graffiti Conjectures about Fullerene Graphs // MATCH : communications in mathematical and in computer chemistry, 76 (2016), 723-730 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 854992 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
On Two Graffiti Conjectures about Fullerene Graphs
Autori
Faghani, Morteza ; Došlić, Tomislav
Izvornik
MATCH : communications in mathematical and in computer chemistry (0340-6253) 76
(2016);
723-730
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
fullerene graph; face independence number; Graffiti; conjecture
Sažetak
We use recently obtained lower bounds on the independence number of fullerene graphs to settle in affirmative a conjecture of the {; ; \em Graffiti}; ; software about the relationship between the independence number and the face independence number of a fullerene graph. We also consider another {; ; \em Graffiti}; ; conjecture, concerned with the relationship of the independence number and the radius of a fullerene graph, and show that it is not valid.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
HRZZ-IP-2013-11-8481 - Biofizikalni dizajn antimikrobnih peptida i inovativni molekularni deskriptori (BioAmpMode) (Vukičević, Damir) ( CroRIS)
Ustanove:
Građevinski fakultet, Zagreb
Profili:
Tomislav Došlić
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus