Metric dimension of some distance-regular graphs

DOI10.1007/S10878-012-9459-XzbMATH Open1298.90121arXiv1105.1847OpenAlexW2127069466MaRDI QIDQ358647FDOQ358647

Authors: Kaishun Wang, Fenggao Li, Jun Guo 

Publication date: 9 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Abstract: A resolving set of a graph is a set of vertices with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. In this paper, we construct a resolving set of Johnson graphs, doubled Odd graphs, doubled Grassmann graphs and twisted Grassmann graphs, respectively, and obtain the upper bounds on the metric dimension of these graphs.

Full work available at URL: https://arxiv.org/abs/1105.1847

Recommendations

• Resolving sets for four families of distance-regular graphs
• The metric dimension of small distance-regular and strongly regular graphs
• On the metric dimension of Grassmann graphs
• On the metric dimension of imprimitive distance-regular graphs
• Metric dimension of dual polar graphs

zbMATH Keywords

metric dimensionJohnson graphdoubled Grassmann graphdoubled Odd graphtwisted Grassmann graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Resolvability in graphs and the metric dimension of a graph
• Base size, metric dimension and other invariants of groups and graphs
• Resolving sets for Johnson and Kneser graphs
• Title not available (Why is that?)
• On the metric dimension of bilinear forms graphs
• Title not available (Why is that?)
• On the metric dimension of Grassmann graphs
• Landmarks in graphs
• On Metric Generators of Graphs
• Partitions of finite vector spaces: an application of the Frobenius number in geometry
• A new family of distance-regular graphs with unbounded diameter
• Mastermind

Cited In (26)

• The equidistant dimension of graphs
• On class dimension of flat association schemes in affine and affine-symplectic spaces
• Resolving sets for four families of distance-regular graphs
• On the metric dimension of Grassmann graphs
• \( [ 1 , 2 ]\)-dimension of graphs
• On the local metric dimension of corona product graphs
• On the edge metric dimension of convex polytopes and its related graphs
• On the metric dimension of the folded \(n\)-cube
• Resolving sets for Johnson and Kneser graphs
• Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
• On adjacency metric dimension of some families of graph
• On the strong metric dimension of corona product graphs and join graphs
• Edge-transitive token graphs
• Metric dimension and pattern avoidance in graphs
• On metric dimension of permutation graphs
• Link dimension and exact construction of graphs from distance vectors
• The metric dimension of small distance-regular and strongly regular graphs
• Regularity and planarity of token graphs
• The simultaneous metric dimension of graph families
• On the metric dimension of imprimitive distance-regular graphs
• The simultaneous local metric dimension of graph families
• Metric dimension of dual polar graphs
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Graphs of order \(n\) with determining number \(n-3\)
• The local metric dimension of strong product graphs
• On the metric dimension of incidence graphs

This page was built for publication: Metric dimension of some distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358647)