The number of independent sets of unicyclic graphs with given matching number
From MaRDI portal
Publication:765345
DOI10.1016/j.dam.2011.09.007zbMath1237.05161MaRDI QIDQ765345
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
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
The Fibonacci numbers of certain subgraphs of circulant graphs, On the intersection of all critical sets of a unicyclic graph, Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges, On the Fibonacci numbers of the composition of graphs, Independent vertex sets in the Zykov sum
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