Counting maximal independent sets in some \(n\)-gonal cacti

DOI10.1016/j.dam.2023.06.023zbMath1528.05035arXiv2202.11294OpenAlexW4383604959MaRDI QIDQ6064859

Pawaton Kaemawichanurat, Nuttanon Songsuwan, Pantaree Thengarnanchai, Natawat Klamsakul, Mattanaporn Suebtangjai, Pailin Kaewperm

Publication date: 11 December 2023

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

Full work available at URL: https://arxiv.org/abs/2202.11294

zbMATH Keywords

asymptoticscactus graphsindependence polynomialindependent domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Zagreb indices, Zagreb polynomials of some nanostar dendrimers
• Distance-based topological indices of the tree-like polyphenyl systems
• Cycle energy and its size dependence
• Chain hexagonal cacti: matchings and independent sets
• The number of maximal independent sets in a connected graph
• Counting independent sets in cocomparability graphs
• Vertex-degree-based topological indices of hexagonal systems with equal number of edges
• On coindices of graphs and their complements
• An improved upper bound on the independent domination number in cubic graphs of girth at least six
• Domination versus independent domination in graphs of small regularity
• On Zagreb eccentricity indices of cacti
• Sombor index of chemical graphs
• On Sombor index of trees
• Maximal independent sets and maximal matchings in series-parallel and related graph classes
• Independent domination in subcubic graphs of girth at least six
• The dissimilarity characteristic of Husimi trees
• On Counting Independent Sets in Sparse Graphs
• Maximal and maximum independent sets in graphs with at mostr cycles
• The Number of Maximal Independent Sets in a Tree
• Enumeration of structure-sensitive graphical subsets: Theory
• Enumeration of structure-sensitive graphical subsets: Calculations
• Wiener Index of Families of Unicyclic Graphs Obtained From a Tree
• Trees with Maximum Vertex-Degree-Based Topological Indices
• Counting the Numbers of Paths of All Lengths in Symmetric Dendrimers and Its Applications
• Ordering chemical graphs by Sombor indices and its applications
• Enumeration of Independent Sets in Benzenoid Chains
• On the Number of Husimi Trees
• Complex Analysis
• On cliques in graphs
• The number of maximum independent sets in graphs

This page was built for publication: Counting maximal independent sets in some \(n\)-gonal cacti