Counting independent dominating sets in linear polymers

DOI10.32513/asetmj/1932200823106zbMath1512.05190arXiv1910.05272OpenAlexW2979612292MaRDI QIDQ6101413

Somayeh Jahari, Saeid Alikhani

Publication date: 20 June 2023

Published in: Advanced Studies: Euro-Tbilisi Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

generating functioncactus graphsindependent dominating sets

Mathematics Subject Classification ID

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
• Graph products of the trivariate total domination polynomial and related polynomials
• The domination polynomial of a graph at \(-1\)
• Chain hexagonal cacti: matchings and independent sets
• The obnoxious center problem on weighted cactus graphs.
• On the independent domination polynomial of a graph
• Counting maximal matchings in linear polymers
• Dominating Set Counting in Graph Classes
• Counting dominating sets in cactus chains
• On the Number of Husimi Trees