scientific article
From MaRDI portal
Publication:3803159
zbMath0656.05057MaRDI QIDQ3803159
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
All metric bases and fault-tolerant metric dimension for square of grid ⋮ On metric dimension of P(n, 2)ʘK1 graph ⋮ Unnamed Item ⋮ Location domination number of line graph ⋮ Decomposition dimension of corona product of some classes of graphs ⋮ On the Connected Partition Dimension of a Wheel Related Graph ⋮ Vertex identification in trees ⋮ Unnamed Item ⋮ TOTAL RESOLVING NUMBER OF CORONA OF GRAPHS AND COMPLETE GRAPHS ⋮ The adjacency dimension of graphs ⋮ Unnamed Item ⋮ Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number ⋮ Sharp bound on the truncated metric dimension of trees ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ Unnamed Item ⋮ New bounds and constructions for neighbor-locating colorings of graphs ⋮ On redundant locating-dominating sets ⋮ On metric dimensions of symmetric graphs obtained by rooted product ⋮ \( [ 1 , 2 \)-dimension of graphs] ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ Extremal graphs for the identifying code problem ⋮ On the metric dimension and diameter of circulant graphs with three jumps ⋮ An optimal locating-dominating set in the infinite triangular grid ⋮ Global location-domination in the join and Cartesian product of graphs ⋮ Domination and location in acyclic graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nordhaus-Gaddum bounds for locating domination ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On resolvability of a graph associated to a finite vector space ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Locating and identifying codes in circulant networks ⋮ Location-2-Domination for Product of Graphs ⋮ The metric dimension of the lexicographic product of graphs ⋮ On Approximation Complexity of Metric Dimension Problem ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A linear algorithm for minimum 1-identifying codes in oriented trees ⋮ Locating and total dominating sets in trees ⋮ Unnamed Item ⋮ Liar's domination ⋮ Unnamed Item ⋮ The metric dimension of circulant graphs and their Cartesian products ⋮ Connected Resolvability of Graphs ⋮ On Connected Resolving Decompositions in Graphs ⋮ Varieties of Roman domination II ⋮ Discrepancies between metric dimension and partition dimension of a connected graph ⋮ Locating-Domination and Identification ⋮ GLOBAL LOCATION-DOMINATION IN THE LEXICOGRAPHIC PRODUCT AND CORONA OF GRAPHS ⋮ Computing the metric dimension of kayak paddles graph and cycles with chord ⋮ Unnamed Item ⋮ Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs ⋮ Unnamed Item ⋮ Lexicographic metric spaces: Basic properties and the metric dimension ⋮ ON CLASSES OF RATIONAL RESOLVING SETS OF DERIVED GRAPHS OF A PATH ⋮ On the Metric Dimension of Infinite Graphs ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Open-independent, open-locating-dominating sets ⋮ Finite metric and 𝑘-metric bases on ultrametric spaces ⋮ The open-locating-dominating number of some convex polytopes ⋮ On locating--dominating sets in infinite grids ⋮ Identification of points using disks ⋮ Computing the metric dimension of wheel related graphs ⋮ On the metric dimension of generalized tensor product of interval with paths and cycles ⋮ \(k\)-metric resolvability in graphs ⋮ LD-graphs and global location-domination in bipartite graphs ⋮ Identifying and locating-dominating codes on chains and cycles ⋮ On the metric basis in wheels with consecutive missing spokes ⋮ On the 2-metric resolvability of graphs ⋮ The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations ⋮ The difference between the metric dimension and the determining number of a graph ⋮ On identifying codes that are robust against edge changes ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ On a new class of identifying codes in graphs ⋮ A polyhedral approach to locating-dominating sets in graphs ⋮ On connected 3-\(\gamma_L\)-dot-critical graphs ⋮ Location-domination in line graphs ⋮ On strong metric dimension of graphs and their complements ⋮ Truncated metric dimension for finite graphs ⋮ The strong metric dimension of graphs and digraphs ⋮ Partition dimension of projective planes ⋮ 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 ⋮ On the Roman domination stable graphs ⋮ Locating-dominating sets in hypergraphs ⋮ Optimal identifying codes in cycles and paths ⋮ On the metric dimension of join of a graph with empty graph(\(O_p\)) ⋮ Linear-time algorithms for three domination-based separation problems in block graphs ⋮ Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ On the strong metric dimension of Cartesian and direct products of graphs ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Locating domination in bipartite graphs and their complements ⋮ On families of convex polytopes with constant metric dimension ⋮ Bounds on the locating Roman domination number in trees ⋮ The multibases of symmetric caterpillars
This page was built for publication:
