A note on the locating-total domination in graphs

DOI10.7151/dmgt.1961zbMath1366.05078OpenAlexW2587235539MaRDI QIDQ2364093

Mirka Miller, R. Sundara Rajan, Indra Rajasingh, R. Jayagopal, Paul D. Manuel

Publication date: 17 July 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1961

zbMATH Keywords

regular graphsdominating settotal dominating setlocating-dominating setlocating-total dominating set

Mathematics Subject Classification ID

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

Related Items (5)

Domination parameters in hypertrees and sibling trees ⋮ Algorithmic results on locating-total domination in graphs ⋮ Unnamed Item ⋮ Locating-total domination in grid graphs ⋮ A note on the complexity of locating-total domination in graphs

Cites Work

• 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
• The bipancycle-connectivity of the hypercube
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• Fault-tolerant locating-dominating sets
• Locating and total dominating sets in trees
• On locating and differetiating-total domination in trees

This page was built for publication: A note on the locating-total domination in graphs