A note on domination and total domination in prisms

DOI10.1007/s10878-017-0150-0zbMath1434.05108OpenAlexW2724759350MaRDI QIDQ1698053

Wayne Goddard, Michael A. Henning

Publication date: 21 February 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0150-0

zbMATH Keywords

dominationtotal dominationprisms

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Minimum Dominating Set for the Prism Graph Family ⋮ Tree 3-spanners on generalized prisms of graphs ⋮ Algorithm and hardness results on neighborhood total domination in graphs ⋮ Bounding the \(k\)-rainbow total domination number ⋮ Total domination in generalized prisms and a new domination invariant

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• (Total) domination in prisms
• \(k\)-tuple total domination in graphs
• On graphs having domination number half their order
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• On the total domination number of Cartesian products of graphs
• Open k-monopolies in graphs: complexity and related concepts
• Paired domination in prisms of graphs
• Paired-domination in graphs
• On dominating the Cartesian product of a graph and K₂
• On the domination number of prisms of graphs

This page was built for publication: A note on domination and total domination in prisms