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

Institutional repository: Repository of the Faculty of Civil Engineering, University of Zagreb

Cite this document

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, no. 12, 2020, pp. 1-7. https://doi.org/10.3390/math8122135

Došlić, Tomislav. "All pairs of pentagons in leapfrog fullerenes are nice." Mathematics 8, no. 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), pp. 1-7. doi: 10.3390/math8122135

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

T. Došlić, "All pairs of pentagons in leapfrog fullerenes are nice", Mathematics, vol. 8, no. 12, pp. 1-7, 2020. [Online]. Available at: https://urn.nsk.hr/urn:nbn:hr:237:045530. [Accessed: 27 December 2024]

Metadata
Title (english)All pairs of pentagons in leapfrog fullerenes are nice
AuthorTomislav Došlić
Author's institutionUniversity of Zagreb
Faculty of Civil Engineering
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract (english)
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.
Keywords (english)
Languageenglish
Publication typeScientific paper - Original scientific paper
Publication statusPublished
Peer reviewPeer review - international
Publication versionPublished version
Journal titleMathematics
Numberingvol. 8, no. 12, pp. 1-7, 2135
e-ISSN2227-7390
DOIhttps://doi.org/10.3390/math8122135
URN:NBNurn:nbn:hr:237:045530
Publication2020
Type of resourceText
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2024-09-04 11:01:48