Lupa

Show document Help

A- | A+ | Print
Title:Clar numbers of leapfrog fullerenes
Authors:ID Graver, Jack E. (Author)
ID Hartung, Elizabeth J. (Author)
Files:.pdf ZUP_Graver_Hartung_2025.pdf (1,70 MB)
MD5: B1CFFB8DFDBDC860399B17ABAD1F5613
 
URL https://dmc-journal.eu/index.php/dmc/article/view/7/4
 
Language:English
Work type:Unknown
Organization:ZUP - University of Primorska Press
Abstract:A fullerene is a 3-regular plane graph with only hexagonal and pentagonal faces. The Fries number of a fullerene G, F(G), is the maximum number of benzene rings over all possible Kekulé structures for G. The Clar number of G, C(G), is the maximum number of independent benzene rings possible over all possible Kekulé structures for G. In this paper, we show that for leapfrog fullerenes, any set of faces attaining the Clar number is a subset of faces attaining the Fries number. This property is false for fullerenes in general (as shown in paper from E. J. Hartung in 2014). We then show that if L(G) is the leapfrog of a fullerene G, then the Clar number of L(G) is equal to the vertex independence number of G.
Keywords:chemical graph theory, fullerenes, leapfrog fullerenes, Clar number, Fries number, Kekulé structure, perfect matching
Publication status:Published
Publication version:Version of Record
Place of publishing:Koper
Publisher:University of Primorska
Year of publishing:2025
Number of pages:str. 1-11
Numbering:Vol. 1, no. 1, [article no. ] P1.05
PID:20.500.12556/RUP-23367 This link opens in a new window
UDC:519.17
ISSN on article:2820-6657
DOI:10.26493/2820-6657.7.9ae This link opens in a new window
COBISS.SI-ID:285430787 This link opens in a new window
Publication date in RUP:27.07.2026
Views:18
Downloads:0
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discrete mathematical chemistry
Publisher:University of Primorska
ISSN:2820-6657
COBISS.SI-ID:109303555 This link opens in a new window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Clarova števila preskakovalnih fulerenov
Abstract:Fuleren je 3-regularen planarni graf, ki ima le šestkotna in petkotna lica. Friesovo število fulerena G,F(G), je največje število benzenovih obročev v vseh možnih Kekuléjevih strukturah za G. Clarovo število G, C (G), je največje število neodvisnih benzenovih obročev v vseh možnih Kekuléjevih strukturah za G. V tem članku pokažemo, da je za preskakovalne fulerene vsaka množica lic, ki doseže Clarovo število, podmnožica množice lic, ki doseže Friesovo število. Ta lastnost ne velja za fulerene v splošnem. Nato pokažemo, da če je L (G) preskakovalni fuleren od G, potem je Clarovo število L (G) enako vozliščnemu neodvisnostnemu številu grafa G.
Keywords:kemijska teorija grafov, fulereni, preskakovalni fulereni, Clarovo število, Friesovo število, Kekuléjeva struktura, popolno prirejanje


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica