The number of independent sets of unicyclic graphs with given matching number

DOI10.1016/j.dam.2011.09.007zbMath1237.05161OpenAlexW2041570514MaRDI QIDQ765345

Gong Chen, Zhongxun Zhu

Publication date: 19 March 2012

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

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

zbMATH Keywords

matchingindependent setunicyclic graphHosoya indexMerrifiled-Simmons index

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges ⋮ The Fibonacci numbers of certain subgraphs of circulant graphs ⋮ Independent vertex sets in the Zykov sum ⋮ On the Fibonacci numbers of the composition of graphs ⋮ On the intersection of all critical sets of a unicyclic graph

Cites Work

• Tricyclic graphs with maximum Merrifield-Simmons index
• On extremal unicyclic molecular graphs with maximal Hosoya index
• The number of independent sets in unicyclic graphs with a given diameter
• On acyclic systems with minimal Hosoya index
• The number of independent sets in unicyclic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of independent sets of unicyclic graphs with given matching number