scientific article; zbMATH DE number 3494441

zbMATH Open0316.05102MaRDI QIDQ4075485FDOQ4075485

Authors: Peter Slater 

Publication date: 1975

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Trees (05C05)

Cited In (only showing first 100 items - show all)

• 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
• A robber locating strategy for trees
• Centroidal localization game
• On optimal approximability results for computing the strong metric dimension
• The fractional \(k\)-metric dimension of graphs
• Locating and paired-dominating sets in graphs
• Fault tolerant detectors for distinguishing sets in graphs
• The fractional \(k\)-truncated metric dimension of graphs
• Computing minimal doubly resolving sets of graphs
• On lower bounds for the metric dimension of graphs
• On graphs with same metric and upper dimension
• A note on the complexity of \(k\)\textsc{-metric dimension}
• Metric dimension of Andrásfai graphs
• Upper dimension and bases of zero-divisor graphs of commutative rings
• Title not available (Why is that?)
• On the metric dimension of Cartesian powers of a graph
• On the constant metric dimension of generalized Petersen graphs \(P(n, 4)\)
• Some properties of the multiset dimension of graphs
• On the partition dimension of trees
• Metric Dimension of Bounded Tree-length Graphs
• The metric dimension of circulant graphs and their Cartesian products
• Vertex and edge dimension of hypergraphs
• On metric dimension of permutation graphs
• Connected Resolvability of Graphs
• On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
• The Edge Partition Dimension of Graphs
• The robber locating game
• Computing the metric dimension of a graph from primary subgraphs
• Relationships between the 2-metric dimension and the 2-adjacency dimension in the lexicographic product of graphs
• On the metric dimension of imprimitive distance-regular graphs
• Comparing the metric and strong dimensions of graphs
• Vertices, edges, distances and metric dimension in graphs
• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
• On the density of identifying codes in the square lattice
• Computing metric dimension of compressed zero divisor graphs associated to rings
• Identifying codes in vertex-transitive graphs and strongly regular graphs
• Resolvability in circulant graphs
• On the metric dimension of barycentric subdivision of Cayley graphs
• On the metric dimension of incidence graphs
• On the edge dimension of a graph
• 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

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)