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

DOI10.1016/J.IPL.2015.07.010zbMATH Open1338.68225OpenAlexW1464226492MaRDI QIDQ495677FDOQ495677

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

cycleCartesian productcombinatorial problemspathlocating-total domination

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Total domination in graphs
• Locating-total domination in graphs
• Locating and total dominating sets in trees
• Locating-total domination in claw-free cubic graphs
• Bounds on the locating-total domination number of a tree

Cited In (4)

• Locating-total domination number of cacti graphs
• Title not available (Why is that?)
• Bounds for complete cototal domination number of Cartesian product graphs and complement graphs
• Locating-total domination in grid graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495677)