Counting independent sets in tricyclic graphs

DOI10.1016/j.dam.2023.01.028OpenAlexW4320169578MaRDI QIDQ2691576

Abolfazl Poureidi

Publication date: 29 March 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.01.028

zbMATH Keywords

countingindependent settricyclic graphlinear-time algorithm

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the lower and upper bounds for different indices of tricyclic graphs
• On the general sum-connectivity index of tricyclic graphs
• Tricyclic graphs with maximal revised Szeged index
• The number of independent sets of tricyclic graphs
• On the number of independent sets in cycle-separated tricyclic graphs
• The reformulated Zagreb indices of tricyclic graphs
• Counting independent sets in tree convex bipartite graphs
• Tricyclic graph with maximal Estrada index
• Fast and simple algorithms to count the number of vertex covers in an interval graph
• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• The Merrifield-Simmons index in \((n,n+ 1)\)-graphs
• Counting the number of independent sets in chordal graphs
• Tricyclic graphs with maximum Merrifield-Simmons index
• The number of independent sets in unicyclic graphs with a given diameter
• Counting independent sets in cocomparability graphs
• On the Merrifield-Simmons index of tricyclic graphs
• Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs
• The number of independent sets in unicyclic graphs
• Maximum values of atom-bond connectivity index in the class of tricyclic graphs
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

This page was built for publication: Counting independent sets in tricyclic graphs