Counting dominating sets in cactus chains

DOI10.2298/FIL1508847BzbMath1464.05189OpenAlexW1773426367MaRDI QIDQ5278711

Kristina Borissevich, Tomislav Došlić

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1508847b

zbMATH Keywords

dominating setdomination number\(m\)-cactus chain

Mathematics Subject Classification ID

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

Related Items (4)

On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices ⋮ On total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices ⋮ Counting independent dominating sets in linear polymers ⋮ Computing forgotten topological index of extremal cactus chains

This page was built for publication: Counting dominating sets in cactus chains