Locating-total domination in graphs

From MaRDI portal
Publication:442212

DOI10.1016/j.dam.2012.04.004zbMath1246.05119OpenAlexW1978191429MaRDI QIDQ442212

Nader Jafari Rad, Michael A. Henning

Publication date: 10 August 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.004




Related Items (22)

A note on the locating-total domination in graphsA constant time algorithm for some optimization problems in rotagraphs and fasciagraphsThe identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operationsBounding the locating-total domination number of a tree in terms of its annihilation numberLocating-total dominating sets in twin-free graphs: a conjectureLocation-domination in line graphsIdentification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexityDomination parameters in hypertrees and sibling treesBounds on the locating Roman domination number in treesAlgorithmic results on locating-total domination in graphsBounds on the locating-domination number and differentiating-total domination number in treesLocating-total domination in claw-free cubic graphsBounds on locating total domination number of the Cartesian product of cycles and pathsBounds on the locating-total domination number in treesDomination Parameters in HypertreesOptimal locating-total dominating sets in strips of height 3Locating-Domination and IdentificationLocating-total domination in grid graphsPolyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphsA note on the complexity of locating-total domination in graphsMy Favorite Domination Conjectures in Graph Theory Are BoundedLocating-paired-dominating sets in square grids



Cites Work


This page was built for publication: Locating-total domination in graphs