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

zbMATH Open1142.05052MaRDI QIDQ5454403FDOQ5454403

Authors: Sean Daugherty, Patrick W. Fowler, Wendy Myrvold 

Publication date: 28 March 2008

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

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)

Cited In (5)

• Title not available (Why is that?)
• On zero-error codes produced by greedy algorithms
• A mathematical programming model for computing the fries number of a fullerene
• The inertia of unicyclic graphs and the implications for closed-shells
• Title not available (Why is that?)

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)