Backtracking to compute the closed-shell independence number of a fullerene

MaRDI QIDQ5454403zbMATH OpenFDO

Authors Sean Daugherty, Patrick W. Fowler, Wendy Myrvold

Publication date 28 March 2008

zbMATH Keywords

graph spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The independence numbers of fullerenes and benzenoids
• A linear time algorithm for finding a maximum independent set of a fullerene
• Closed formulas for the number of small paths, independent sets and matchings in fullerenes
• On two Graffiti conjectures about fullerene graphs
• An upper bound on the independence number of benzenoid systems

Cited in

(5)

• The inertia of unicyclic graphs and the implications for closed-shells
• scientific article; zbMATH DE number 5627531 (Why is no real title available?)
• A mathematical programming model for computing the fries number of a fullerene
• scientific article; zbMATH DE number 6750326 (Why is no real title available?)
• On zero-error codes produced by greedy algorithms

This page was built for publication: Backtracking to compute the closed-shell independence number of a fullerene

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