2019/09/29 by Somayeh Jahari, Jahari, Somayeh, Saeid Alikhani +1
Computer Science · Materials Science · #05C30 #05C69 #Advanced Graph Theory Research #FOS: Mathematics #Formal Methods in Verification #General Mathematics (math.GM) #Synthesis and properties of polymers
paper · pdf · doi:10.48550/arxiv.1910.05272
openalex publication_date 2019/09/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A vertex subset W⊆ V of the graph G = (V,E) is an independent dominating set if every vertex in V∖ W 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.