scientific article; zbMATH DE number 3494441
From MaRDI portal
Publication:4075485
zbMATH Open0316.05102MaRDI QIDQ4075485FDOQ4075485
Authors: Peter Slater
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- On the strong metric dimension of the strong products of graphs
- On the metric dimension of certain metric manifolds
- On strong metric dimension of graphs and their complements
- The partition dimension of strong product graphs and Cartesian product graphs
- On the strong partition dimension of graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Is it possible to determine a point lying in a simplex if we know the distances from the vertices?
- Strong resolving partitions for strong product graphs and Cartesian product graphs
- On families of convex polytopes with constant metric dimension
- Metric dimension of some distance-regular graphs
- The metric dimension of metric spaces
- On the metric dimension of bilinear forms graphs
- On the metric dimension of circulant graphs
- The metric dimension of geometric spaces
- Liar's domination
- A linear time algorithm for metric dimension of cactus block graphs
- Computing the metric dimension of wheel related graphs
- The \(k\)-metric dimension of the lexicographic product of graphs
- \(k\)-metric resolvability in graphs
- Closed formulae for the local metric dimension of corona product graphs
- On the strong metric dimension of product graphs
- Simultaneous resolvability in graph families
- On the strong metric dimension of Cartesian and direct products of graphs
- Approximation complexity of metric dimension problem
- On the commuting graph of semidihedral group
- On the locating chromatic number of Kneser graphs
- Uniquely identifying the edges of a graph: the edge metric dimension
- Bibliography on domination in graphs and some basic definitions of domination parameters
- A note on the partition dimension of Cartesian product graphs
- A characterization of some graphs with metric dimension two
- On the metric dimension of corona product graphs
- Determining sets, resolving sets, and the exchange property
- The \(k\)-metric dimension of corona product graphs
- The metric dimension of the lexicographic product of graphs
- On the metric dimension of circulant and Harary graphs
- The difference between the metric dimension and the determining number of a graph
- Mixed metric dimension of graphs
- On the metric dimension of infinite graphs
- Resolvability in graphs and the metric dimension of a graph
- Destroying automorphisms by fixing nodes
- The strong metric dimension of graphs and digraphs
- Graphs of order \(n\) with locating-chromatic number \(n-1\)
- Resolvability and the upper dimension of graphs
- Distance-based vertex identification in graphs: the outer multiset dimension
- On the fractional strong metric dimension of graphs
- Complexity of metric dimension on planar graphs
- Asymptotic behavior of the edge metric dimension of the random graph
- The fractional metric dimension of graphs
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- The (weighted) metric dimension of graphs: hard and easy cases
- Partition dimension of rooted product graphs
- Discrepancies between metric dimension and partition dimension of a connected graph
- The metric dimension of Cayley digraphs
- Closed formulae for the strong metric dimension of lexicographic product graphs
- The structure and metric dimension of the power graph of a finite group
- Resolvability of Hamming graphs
- On the k-metric dimension of metric spaces
- On metric orbit spaces and metric dimension
- The simultaneous metric dimension of families composed by lexicographic product graphs
- Extremal problems on detectable colorings of trees
- Nordhaus-Gaddum bounds for locating domination
- Open neighborhood locating-dominating in trees
- Liar's domination in graphs
- Computing the \(k\)-metric dimension of graphs
- On the metric dimension of some families of graphs
- Metric dimension of bounded width graphs
- The simultaneous metric dimension of graph families
- Locating a robber on a graph via distance queries
- The fractional metric dimension of permutation graphs
- Metric dimension of maximal outerplanar graphs
- Coloring, location and domination of corona graphs
- Computing the metric dimension for chain graphs
- Completeness-resolvable graphs
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- On the fractional metric dimension of graphs
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- Locating and total dominating sets in trees
- Locating a robber on a graph
- Sequential metric dimension for random graphs
- Bounds on the domination number and the metric dimension of co-normal product of graphs
- On the metric dimension of generalized tensor product of interval with paths and cycles
- A polynomial sized kernel for tracking paths problem
- Extremal Graph Theory for Metric Dimension and Diameter
- Vertex and edge metric dimensions of unicyclic graphs
- On some plane graphs and their metric dimension
- Conditional resolvability of honeycomb and hexagonal networks
- Localization game on geometric and planar graphs
- Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
- On the metric dimensions for sets of vertices
- Metric and upper dimension of zero divisor graphs associated to commutative rings
- On randomly \(k\)-dimensional graphs
- On the edge dimension and the fractional edge dimension of graphs
- Locating a robber with multiple probes
- Locating a backtracking robber on a tree
- Annihilating-ideal graphs of commutative rings
- Subdivisions in the robber locating game
- Metric dimension of Cayley digraphs of split metacyclic groups
- Simultaneous resolvability in families of corona product graphs
- The simultaneous strong metric dimension of graph families
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4075485)