Counting independent dominating sets in linear polymers

DOI10.32513/ASETMJ/1932200823106MaRDI QIDQ6101413zbMATH OpenOpenAlexFDO

Authors Saeid Alikhani, Somayeh Jahari

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

cactus graphsgenerating functionindependent dominating sets

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: A vertex subset $WsubseteqV$ of the graph $G=(V,E)$ is an independent dominating set if every vertex in $VsetminusW$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent dominating sets in several classes of graphs made by a linear or cyclic concatenation of basic building blocks. Explicit recurrences are derived for the number of independent dominating sets of these kind of graphs. Generating functions for the number of independent dominating sets of triangular and squares cacti chain are also computed.

Cites work

• Chain hexagonal cacti: matchings and independent sets
• Counting dominating sets in cactus chains
• Counting maximal matchings in linear polymers
• Dominating Set Counting in Graph Classes
• Graph products of the trivariate total domination polynomial and related polynomials
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 6410527 (Why is no real title available?)
• scientific article; zbMATH DE number 5238170 (Why is no real title available?)
• On the independent domination polynomial of a graph
• On the Number of Husimi Trees
• On the number of outer connected dominating sets of graphs
• The domination polynomial of a graph at -1
• The obnoxious center problem on weighted cactus graphs.

Cited in

(1)

• A family of metrics for biopolymers based on counting independent sets

This page was built for publication: Counting independent dominating sets in linear polymers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101413)