The number of independent sets in unicyclic graphs
From MaRDI portal
Publication:2576351
DOI10.1016/j.dam.2005.04.002zbMath1080.05069OpenAlexW2129259679MaRDI QIDQ2576351
Anders Sune Pedersen, Preben Dahl Vestergaard
Publication date: 27 December 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://vbn.aau.dk/da/publications/c28fff80-9ee4-11da-917e-000ea68e967b
Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
The Fibonacci numbers of certain subgraphs of circulant graphs ⋮ The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs ⋮ Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices ⋮ Trees with given stability number and minimum number of stable sets ⋮ On Hosoya Index and Merrifield‐Simmons Index of trees with given domination number ⋮ The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\) ⋮ Counting independent sets in tricyclic graphs ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ The Hosoya index and the Merrifield-Simmons index ⋮ The Merrifield-Simmons index in \((n,n+ 1)\)-graphs ⋮ The maximum number of maximal independent sets in unicyclic connected graphs ⋮ Trees with extremal numbers of maximal independent sets including the set of leaves ⋮ Independent sets in graphs ⋮ Independent vertex sets in the Zykov sum ⋮ Efficient algorithms for independent Roman domination on some classes of graphs ⋮ On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs ⋮ A simple proof of an inequality connecting the alternating number of independent sets and the decycling number ⋮ Tricyclic graphs with maximum Merrifield-Simmons index ⋮ Graphs with given number of cut vertices and extremal Merrifield-Simmons index ⋮ On the number of independent subsets in trees with restricted degrees ⋮ On the number of independent sets in cycle-separated tricyclic graphs ⋮ Ordering trees with given pendent vertices with respect to Merrifield-Simmons indices and Hosoya indices ⋮ On the Fibonacci numbers of the composition of graphs ⋮ The number of independent sets in a connected graph and its complement ⋮ The number of independent sets in unicyclic graphs with a given diameter ⋮ Fibonacci numbers and Lucas numbers in graphs ⋮ The number of independent sets of unicyclic graphs with given matching number ⋮ Maximal independent sets in caterpillar graphs ⋮ A sharp upper bound for the number of stable sets in graphs with given number of cut edges ⋮ Fibonacci index and stability number of graphs: a polyhedral study ⋮ Turán Graphs, Stability Number, and Fibonacci Index
Cites Work
