Domination and location in acyclic graphs
From MaRDI portal
Publication:3786298
DOI10.1002/net.3230170105zbMath0643.90089OpenAlexW2006716595MaRDI QIDQ3786298
Publication date: 1987
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230170105
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Related Items (93)
On locating--dominating sets in infinite grids ⋮ Location domination number of line graph ⋮ Fractional metric dimension of generalized prism graph ⋮ Revisiting and Improving Upper Bounds for Identifying Codes ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ Approximability of identifying codes and locating-dominating codes ⋮ Structural characterization of some family of local distance pattern distinguishing graphs ⋮ A polyhedral approach to locating-dominating sets in graphs ⋮ On connected 3-\(\gamma_L\)-dot-critical graphs ⋮ Location-domination in line graphs ⋮ Truncated metric dimension for finite graphs ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ On regular and new types of codes for location-domination ⋮ Coloring, location and domination of corona graphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ The adjacency dimension of graphs ⋮ The number of completely different optimal identifying codes in the infinite square grid ⋮ Locating-dominating sets in hypergraphs ⋮ Linear-time algorithms for three domination-based separation problems in block graphs ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Sharp bound on the truncated metric dimension of trees ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters ⋮ The dominating partition dimension and locating-chromatic number of graphs ⋮ The fractional metric dimension of graphs ⋮ Bounds on the locating Roman domination number in trees ⋮ On the complexity of variations of mixed domination on graphs† ⋮ On three domination-based identification problems in block graphs ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ On redundant locating-dominating sets ⋮ Open neighborhood locating-dominating in trees ⋮ \( [ 1 , 2 \)-dimension of graphs] ⋮ Progress on fault-tolerant locating-dominating sets ⋮ Locating-dominating codes: bounds and extremal cardinalities ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ On the size of identifying codes in triangle-free graphs ⋮ Locating-dominating sets in twin-free graphs ⋮ Location-domination and matching in cubic graphs ⋮ The binary locating-dominating number of some convex polytopes ⋮ Locating-total domination in graphs ⋮ Bounds on the locating-domination number and differentiating-total domination number in trees ⋮ Identifying codes and locating-dominating sets on paths and cycles ⋮ Unnamed Item ⋮ Optimal identifying codes in the infinite 3-dimensional king grid ⋮ On resolvability of a graph associated to a finite vector space ⋮ Covering codes of a graph associated with a finite vector space ⋮ Well-located graphs: A collection of well-covered ones ⋮ Locating-total domination in claw-free cubic graphs ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Location-2-Domination for Product of Graphs ⋮ Local Distance Pattern Distinguishing Sets in Graphs ⋮ On the upper bounds of fractional metric dimension of symmetric networks ⋮ Centroidal localization game ⋮ On trees with unique locating kernels ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. ⋮ On a conjecture regarding identification in Hamming graphs ⋮ The algorithmic complexity of mixed domination in graphs ⋮ Locating and paired-dominating sets in graphs ⋮ Unnamed Item ⋮ Minimal identifying codes in trees and planar graphs with large girth ⋮ A linear algorithm for minimum 1-identifying codes in oriented trees ⋮ Locating and total dominating sets in trees ⋮ Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes ⋮ Locating-dominating codes in paths ⋮ Liar's domination ⋮ Simultaneous resolvability in families of corona product graphs ⋮ Sequential metric dimension ⋮ The solid-metric dimension ⋮ Classification of upper bound sequences of local fractional metric dimension of rotationally symmetric hexagonal planar networks ⋮ Varieties of Roman domination II ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ On locating-dominating set of regular graphs ⋮ Locating-Domination and Identification ⋮ Optimal bounds on codes for location in circulant graphs ⋮ Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs ⋮ Improved lower bound for locating-dominating codes in binary Hamming spaces ⋮ Domination and location in twin-free digraphs ⋮ Liar's domination in graphs ⋮ On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs ⋮ Locating-dominating sets of functigraphs ⋮ Bounding the trace function of a hypergraph with applications ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ Open-independent, open-locating-dominating sets ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes ⋮ The open-locating-dominating number of some convex polytopes ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5 ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ ON FRACTIONAL METRIC DIMENSION OF GRAPHS
Cites Work
This page was built for publication: Domination and location in acyclic graphs
