The number of independent sets in unicyclic graphs with a given diameter
From MaRDI portal
Publication:1028107
DOI10.1016/j.dam.2008.10.012zbMath1172.05326OpenAlexW1986124287MaRDI QIDQ1028107
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.012
Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (11)
Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ Trees with given stability number and minimum number of stable sets ⋮ Further results on the Merrifield-Simmons index ⋮ Counting independent sets in tricyclic graphs ⋮ The Hosoya Index and the Merrifield–Simmons Index of Some Nanostructures ⋮ On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs ⋮ Tricyclic graphs with maximum Merrifield-Simmons index ⋮ Graphs with given number of cut vertices and extremal Merrifield-Simmons index ⋮ The number of independent sets of unicyclic graphs with given matching number ⋮ A mathematical approach on representation of competitions: competition cluster hypergraphs ⋮ On the Merrifield-Simmons index of tricyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
- Maximal independent sets in graphs with at most one cycle
- Extremal catacondensed benzenoids
- Extremal hexagonal chains concerning largest eigenvalue
- The number of independent sets in unicyclic graphs
- On the hardness of approximate reasoning
- On cliques in graphs
- The number of maximum independent sets in graphs
This page was built for publication: The number of independent sets in unicyclic graphs with a given diameter
