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
• Edge metric dimension of some graph operations
• The metric dimension of some generalized Petersen graphs
• Different-distance sets in a graph
• On the metric dimension, the upper dimension and the resolving number of graphs
• The Local metric dimension of the lexicographic product of graphs
• Edge metric dimension of some generalized Petersen graphs
• The adjacency dimension of graphs
• On graphs with the maximum edge metric dimension
• \(k\)-metric antidimension: a privacy measure for social graphs
• Some structural, metric and convex properties on the boundary of a graph
• The localization game on oriented graphs
• Fault-tolerant metric dimension problem: a new integer linear programming formulation and exact formula for grid graphs
• The full automorphism groups, determining sets and resolving sets of coprime graphs
• The weighted 2-metric dimension of trees in the non-landmarks model
• Fault-tolerant resolvability in some classes of line graphs
• Resolvability in subdivision of circulant networks \(C_n[1, k]\)
• On the fault-tolerant metric dimension of convex polytopes
• On the distance pattern distinguishing number of a graph
• On mixed metric dimension in subdivision, middle, and total graphs
• Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\)
• On the fault-tolerant metric dimension of certain interconnection networks
• Metric properties of generalized Sierpiński graphs over stars
• On upper dimension of graphs and their bases sets
• Extremal results for graphs of bounded metric dimension
• Computing metric dimension and metric basis of 2D lattice of alpha-boron nanotubes
• On the edge metric dimension of convex polytopes and its related graphs
• Edge version of metric dimension and doubly resolving sets of the necklace graph
• Graphs with doubly resolving number 2
• Computing the metric dimension of convex polytopes generated by wheel related graphs
• The partition dimension of circulant graphs
• Resolving dominating partitions in graphs
• Mixed metric dimension of graphs with edge disjoint cycles
• Title not available (Why is that?)
• The \(k\)-metric dimension
• On the metric dimension of the folded \(n\)-cube
• Edge and pair queries-random graphs and complexity
• New resolvability parameters of graphs
• Title not available (Why is that?)
• On the number of resolving pairs in graphs
• Extending the metric dimension to graphs with missing edges
• Metric dimension of fullerene graphs

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)