Matchings in m-generalized fullerene graphs

DOI10.26493/1855-3974.882.539MaRDI QIDQ2958698zbMATH OpenOpenAlexWikidataFDO

Authors Tomislav Došlić, A. Behmaram, S. Friedland

Publication date 3 February 2017

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.882.539

zbMATH Keywords

perfect matchingPfaffian graphHadamard-Fischer inequalityfullerene graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Determinants, permanents, traces, other special matrix functions (15A15) Enumeration in graph theory (05C30) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
• New lower bound on the number of perfect matchings in fullerene graphs
• On lower bounds of number of perfect matchings in fullerene graphs
• Fullerene graphs with exponentially many perfect matchings
• On the number of matchings and independent sets in \((3,6)\)-fullerenes

Cited in

(16)

• scientific article; zbMATH DE number 6282162 (Why is no real title available?)
• Fullerene graphs with exponentially many perfect matchings
• Finding more perfect matchings in leapfrog fullerenes
• Saturation number of lattice animals
• On the number of matchings and independent sets in \((3,6)\)-fullerenes
• Partition of -electrons among the faces of polyhedral carbon clusters
• Closed formulas for the number of small paths, independent sets and matchings in fullerenes
• On some structural properties of generalized fullerene graphs with 13 pentagonal faces
• Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
• On lower bounds of number of perfect matchings in fullerene graphs
• Topological indices of 3-generalized fullerenes
• Upper bounds for perfect matchings in Pfaffian and planar graphs
• scientific article; zbMATH DE number 6274836 (Why is no real title available?)
• On 2-distance-balanced graphs
• Distance-restricted matching extendability of fullerene graphs
• Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs

This page was built for publication: Matchings in \(m\)-generalized fullerene graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958698)