Bounds on locating total domination number of the Cartesian product of cycles and paths

DOI10.1016/j.ipl.2015.07.010zbMath1338.68225OpenAlexW1464226492MaRDI QIDQ495677

Moo Young Sohn, Hua-Ming Xing

Publication date: 15 September 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.010

zbMATH Keywords

cyclecombinatorial problemspathCartesian productlocating-total domination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Locating-total domination number of cacti graphs ⋮ Locating-total domination in grid 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
• Locating and total dominating sets in trees
• Total domination in graphs

This page was built for publication: Bounds on locating total domination number of the Cartesian product of cycles and paths