Metric dimension of some distance-regular graphs

DOI10.1007/S10878-012-9459-XMaRDI QIDQ358647zbMATH OpenOpenAlexFDO

Authors Kaishun Wang, Fenggao Li, Jun Guo

Publication date 9 August 2013

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

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

zbMATH Keywords

doubled Grassmann graphdoubled Odd graphJohnson graphmetric dimensiontwisted Grassmann graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

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.

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

Cites work

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

Cited in

(28)

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

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)