The number of independent sets in unicyclic graphs
From MaRDI portal
Publication:2576351
Recommendations
- scientific article; zbMATH DE number 6260097
- The numbers of maximal independent sets in connected unicyclic graphs
- The number of independent sets in unicyclic graphs with a given diameter
- Some results on the independence polynomial of unicyclic graphs
- Bounds on the number of vertex independent sets in a graph
Cites work
- An upper bound on the number of independent sets in a tree.
- Bounds on the number of vertex independent sets in a graph
- scientific article; zbMATH DE number 3745213 (Why is no real title available?)
- scientific article; zbMATH DE number 1465674 (Why is no real title available?)
- scientific article; zbMATH DE number 808335 (Why is no real title available?)
- Maximal independent sets in graphs with at most one cycle
- On cliques in graphs
- On the hardness of approximate reasoning
- The number of maximum independent sets in graphs
Cited in
(48)- The number of independent sets in unicyclic graphs with a given diameter
- Fibonacci numbers and Lucas numbers in 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
- Some results on the independence polynomial of unicyclic graphs
- The Hosoya index and the Merrifield-Simmons index
- Trees with given stability number and minimum number of stable sets
- The cyclomatic number of a graph and its independence polynomial at - 1
- On the Fibonacci numbers of the composition of graphs
- Independent vertex sets in the Zykov sum
- Ordering trees with given pendent vertices with respect to Merrifield-Simmons indices and Hosoya indices
- Bounds on the number of vertex independent sets in a graph
- The smallest Merrifield-Simmons index of (n,n+1)-graphs
- Counting independent sets in tricyclic graphs
- The numbers of maximal independent sets in connected unicyclic graphs
- The Fibonacci numbers of certain subgraphs of circulant graphs
- On dissection of unicyclic graphs
- Unicyclic graphs with the extremal number of independent sets containing pendant vertices
- The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most \(K^{\bigstar}\)
- On the core of a unicyclic graph
- Independent sets in graphs
- How many unicycles on a wheel?
- The number of independent sets in a connected graph and its complement
- scientific article; zbMATH DE number 6260097 (Why is no real title available?)
- A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
- The order of two special type unicyclic graphs by their independent index
- Graphs with given number of cut vertices and extremal Merrifield-Simmons index
- Turán Graphs, Stability Number, and Fibonacci Index
- On the number of independent subsets in trees with restricted degrees
- On the number of independent sets in cycle-separated tricyclic graphs
- Maximising the number of connected induced subgraphs of unicyclic graphs
- The Average Size of Independent Sets in Unicyclic Graphs
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- On Hosoya Index and Merrifield‐Simmons Index of trees with given domination number
- Efficient algorithms for independent Roman domination on some classes of graphs
- Fractional vertex cover reliability of graphs
- Comparison between Merrifield-Simmons index and eccentric distance sum
- The number of independent sets in bipartite graphs and benzenoids
- On average sizes and enumeration of minimal edge covers
- On the unimodality of the independent set numbers of a class of matroids
- The number of independent sets of unicyclic graphs with given matching number
- Maximal independent sets in caterpillar graphs
- The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
- 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
- On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs
- Tricyclic graphs with maximum Merrifield-Simmons index
This page was built for publication: The number of independent sets in unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576351)
