Closed formulas for the number of small paths, independent sets and matchings in fullerenes

DOI10.1016/j.aml.2012.01.045zbMath1251.05118WikidataQ61987614 ScholiaQ61987614MaRDI QIDQ712590

Ali Reza Ashrafi, Afshin Behmaram, Hassan Yousefi-Azari

Publication date: 17 October 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2012.01.045

zbMATH Keywords

matching; independent set; fullerene

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

Cites Work

• The number of perfect matchings in a hypercube
• Matching polynomials for chains of cycles
• On matching coefficients
• A linear algorithm for perfect matching in hexagonal systems
• Problems in algebraic combinatorics
• Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
• The number of matchings of low order in hexagonal systems
• Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item