On the number of matchings and independent sets in (3,6)-fullerenes
From MaRDI portal
Publication:5408296
zbMATH Open1299.05168MaRDI QIDQ5408296FDOQ5408296
Authors: H. Yousefi-Azari, A. R. Ashrafi, A. Behmaram 
Publication date: 9 April 2014
Recommendations
Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (14)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Closed formulas for the number of small paths, independent sets and matchings in fullerenes
- On bicriticality of (3,6)-fullerene graphs
- Number of matchings of low order in (4,6)-Fullerene graphs
- Distance under symmetry: (3,6)-fullerenes
- Title not available (Why is that?)
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
- On the number of 5-matchings in boron-nitrogen fullerene graphs.
- Matchings in \(m\)-generalized fullerene graphs
- Computing the number of matchings in catacondensed benzenoid systems
- Restricted 2-extendability of (3,6)-fullerenes
- Zigzag Structures of Simple Two-Faced Polyhedra
- On the growth rate of the number of fullerenes
This page was built for publication: On the number of matchings and independent sets in \((3,6)\)-fullerenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408296)
