prikaz prve stranice dokumenta All pairs of pentagons in leapfrog fullerenes are nice
  Preuzmi
PDF 209.75 KB
Znanstveni rad - Izvorni znanstveni rad
All pairs of pentagons in leapfrog fullerenes are nice
Mathematics, 8 (2020), 12; 1-7. https://doi.org/10.3390/math8122135
Došlić, Tomislav

Citirajte ovaj rad

Došlić, T. (2020). All pairs of pentagons in leapfrog fullerenes are nice. Mathematics, 8. (12), 1-7. doi: 10.3390/math8122135

Došlić, Tomislav. "All pairs of pentagons in leapfrog fullerenes are nice." Mathematics, vol. 8, br. 12, 2020, str. 1-7. https://doi.org/10.3390/math8122135

Došlić, Tomislav. "All pairs of pentagons in leapfrog fullerenes are nice." Mathematics 8, br. 12 (2020): 1-7. https://doi.org/10.3390/math8122135

Došlić, T. (2020) 'All pairs of pentagons in leapfrog fullerenes are nice', Mathematics, 8(12), str. 1-7. doi: 10.3390/math8122135

Došlić T. All pairs of pentagons in leapfrog fullerenes are nice. Mathematics [Internet]. 2020. [pristupljeno 15.11.2024.];8(12):1-7. doi: 10.3390/math8122135

T. Došlić, "All pairs of pentagons in leapfrog fullerenes are nice", Mathematics, vol. 8, br. 12, str. 1-7, 2020. [Online]. Dostupno na: https://urn.nsk.hr/urn:nbn:hr:237:045530. [Citirano: 15.11.2024.]

Za citiranje koristite ovu mrežnu adresu: https://urn.nsk.hr/urn:nbn:hr:237:045530
Prijavite se u repozitorij kako biste mogli spremiti objekt u svoju listu.
Podaci o radu
Naslov (engleski)All pairs of pentagons in leapfrog fullerenes are nice
AutorTomislav Došlić
Autorova ustanovaSveučilište u Zagrebu
Građevinski fakultet
Znanstveno / umjetničko
područje, polje i grana		PRIRODNE ZNANOSTI
Matematika
Sažetak (engleski)
A subgraph H of a graph G with perfect matching is nice if G 􀀀V(H) has perfect matching. It is well-known that all fullerene graphs have perfect matchings and that all fullerene graphs contain some small connected graphs as nice subgraphs. In this contribution, we consider fullerene graphs arising from smaller fullerenes via the leapfrog transformation, and show that in such graphs, each pair of (necessarily disjoint) pentagons is nice. That answers in affirmative a question posed in a recent paper on nice pairs of odd cycles in fullerene graphs.
Ključne riječi (engleski)
Jezikengleski
Vrsta publikacijeZnanstveni rad - Izvorni znanstveni rad
Status objaveObjavljen
Vrsta recenzijeRecenziran - međunarodna recenzija
Verzija publikacijeObjavljena verzija rada (izdavačev PDF)
Naslov časopisaMathematics
Brojčani podacivol. 8, br. 12, str. 1-7, 2135
e-ISSN2227-7390
DOIhttps://doi.org/10.3390/math8122135
URN:NBNurn:nbn:hr:237:045530
Datum objave publikacije2020
Vrsta resursaTekst
Prava pristupaOtvoreni pristup
Uvjeti korištenjaIkona licence Zaštićeno autorskim pravom.
Datum i vrijeme pohrane2024-09-04 11:01:48