On the number of independent sets in cycle-separated tricyclic graphs

DOI10.1016/J.CAMWA.2011.01.021zbMath1217.05108OpenAlexW2059645304MaRDI QIDQ552339

Ardeshir Dolati

Publication date: 21 July 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.01.021

zbMATH Keywords

independent setFibonacci numbertight boundcycle-separated tricyclic graphmax-touch-vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (2)

On the lower and upper bounds for different indices of tricyclic graphs ⋮ Counting independent sets in tricyclic graphs

Cites Work

• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Enumeration of matchings in families of self-similar graphs
• The Merrifield-Simmons index in \((n,n+ 1)\)-graphs
• On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
• Tricyclic graphs with maximum Merrifield-Simmons index
• On the number of independent sets in a tree
• Sharp lower bound for the total number of matchings of tricyclic graphs
• Almost all trees have an even number of independent sets
• The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs
• The number of independent sets in unicyclic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of independent sets in cycle-separated tricyclic graphs