Domination Parameters in Hypertrees

DOI10.1007/978-3-319-29221-2_26zbMath1444.05107OpenAlexW2402370795MaRDI QIDQ2795956

R. Sundara Rajan, R. Jayagopal, Indra Rajasingh

Publication date: 23 March 2016

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_26

zbMATH Keywords

dominating settotal dominating sethypertreelocating-dominating setlocating-total dominating set

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locating-total domination in graphs
• Locating-total domination in claw-free cubic graphs
• Bounds on the locating-total domination number of a tree
• Identifying codes and locating-dominating sets on paths and cycles
• On locating--dominating sets in infinite grids
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• Fault-tolerant locating-dominating sets
• Locating and identifying codes in circulant networks
• Locating and total dominating sets in trees
• On covering sets and error-correcting codes
• A characterization of locating-total domination edge critical graphs
• Towards a theory of domination in graphs

This page was built for publication: Domination Parameters in Hypertrees