Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets

DOI10.1016/j.dam.2007.06.003zbMath1125.05101OpenAlexW2053288868MaRDI QIDQ2457007

Haizhen Ren, Fu Ji Zhang

Publication date: 29 October 2007

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

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

zbMATH Keywords

\(k\)-independent set\(k\)-matchingdouble hexagonal chainquasi-ordering

Mathematics Subject Classification ID

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

Related Items (6)

Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ On the k-matchings of the complements of bicyclic graphs ⋮ Monomer-dimer problem on random planar honeycomb lattice ⋮ On the coefficients of the independence polynomial of graphs ⋮ Computing the Merrifield-Simmons indices of benzenoid chains and double benzenoid chains ⋮ Independence polynomials of bipartite graphs

Cites Work

• The matching polynomial of a polygraph
• On the ordering of graphs with respect to their matching numbers
• An introduction to matching polynomials
• On the theory of the matching polynomial
• Extremal hexagonal chains concerning \(k\)-matchings and \(k\)-independent sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets