Locating and total dominating sets in trees
From MaRDI portal
Publication:2495911
DOI10.1016/j.dam.2006.01.002zbMath1091.05051MaRDI QIDQ2495911
Jamie Howard, Michael A. Henning, Teresa W. Haynes
Publication date: 30 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://dc.etsu.edu/cgi/viewcontent.cgi?article=2029&context=etd
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
The binary locating-dominating number of some convex polytopes, Unnamed Item, Revisiting and Improving Upper Bounds for Identifying Codes, Computing the local metric dimension of a graph from the local metric dimension of primary subgraphs, My Favorite Domination Conjectures in Graph Theory Are Bounded, Unnamed Item, Semitotal domination in claw-free cubic graphs, Strong metric dimension of rooted product graphs, Bounds and extremal graphs for total dominating identifying codes, Algorithmic results on locating-total domination in graphs, The \textsc{Red-Blue Separation} problem on graphs, Locating-total dominating sets in twin-free graphs: a conjecture, A polyhedral approach to locating-dominating sets in graphs, Location-domination in line graphs, On the strong metric dimension of Cartesian and direct products of graphs, Locating-total domination in graphs, Locating-total domination in claw-free cubic graphs, Bounds on locating total domination number of the Cartesian product of cycles and paths, Bounds on the locating-total domination number of a tree, Which trees have a differentiating-paired dominating set?, A note on the partition dimension of Cartesian product graphs, Open neighborhood locating-dominating in trees, On the metric dimension of corona product graphs, The \(k\)-metric dimension of corona product graphs, On the local metric dimension of corona product graphs, The simultaneous metric dimension of graph families, Bounds on the differentiating-total domination number of a tree, Locating and paired-dominating sets in graphs, Bounding the locating-total domination number of a tree in terms of its annihilation number, Bounds on the locating Roman domination number in trees, On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results, Bounds on the locating-domination number and differentiating-total domination number in trees, On the strong metric dimension of corona product graphs and join graphs, Bounds on the identifying codes in trees, Resolving dominating partitions in graphs, Differentiating-total domination: approximation and hardness results, Characterizing extremal graphs for open neighbourhood location-domination, Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs, The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations, On adjacency metric dimension of some families of graph, Domination parameters in hypertrees and sibling trees, Locating-total domination number of cacti graphs, A note on \(k\)-metric dimensional graphs, Locating and identifying codes in circulant graphs, Bounds on the locating-total domination number in trees, Locating-total domination in grid graphs, The simultaneous local metric dimension of graph families, A note on the complexity of locating-total domination in graphs, Binary locating-dominating sets in rotationally-symmetric convex polytopes, Locating-dominating sets and identifying codes in graphs of girth at least 5, Locating-paired-dominating sets in square grids, A note on the locating-total domination in graphs, On the partition dimension of a class of circulant graphs, Locating and identifying codes in circulant networks, On the strong metric dimension of tetrahedral diamond lattice, Optimal locating-total dominating sets in strips of height 3, The local metric dimension of strong product graphs, On the partition dimension of trees, Domination Parameters in Hypertrees, Liar's domination, Locating-Domination and Identification, A note on -vertex critical graphs
Cites Work
