An upper bound on the independence number of benzenoid systems

DOI10.1016/J.DAM.2007.07.019MaRDI QIDQ2476249zbMATH OpenOpenAlexFDO

Authors Ryan Pepper

Publication date 18 March 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.07.019

zbMATH Keywords

benzenoid systemsindependence numbersupper bound

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• The independence numbers of fullerenes and benzenoids
• On two Graffiti conjectures about fullerene graphs
• On the Clar Number of Benzenoid Graphs
• Clar and fries numbers for benzenoids
• Advances in graph theory methods of benzenoid systems

Cites work

• Graph theory
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1890095 (Why is no real title available?)

Cited in

(3)

• The independence numbers of fullerenes and benzenoids
• Backtracking to compute the closed-shell independence number of a fullerene
• The complexity of pre-assignment problem for unique minimum vertex cover on bipartite graphs

Describes a project that uses

Uses Software

• GRAFFITI

This page was built for publication: An upper bound on the independence number of benzenoid systems

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