On the metric dimension of incidence graphs
From MaRDI portal
Publication:1744744
DOI10.1016/j.disc.2018.03.001zbMath1384.05076arXiv1707.02899OpenAlexW2964027166MaRDI QIDQ1744744
Publication date: 19 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.02899
symmetric designdistance-regular graphresolving setmetric dimensionincidence graphsymmetric transversal designsymmetric net
Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Connectivity (05C40)
Related Items
Metric dimension and metric independence number of incidence graphs of symmetric designs ⋮ Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications ⋮ \( [ 1 , 2 \)-dimension of graphs] ⋮ On graphs of order \(n\) with metric dimension \(n-4\) ⋮ The localization number of designs ⋮ Metric dimension of dual polar graphs ⋮ On the metric dimension of incidence graph of M\"obius planes ⋮ Unnamed Item ⋮ On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On class dimension of flat association schemes in affine and affine-symplectic spaces
- Distance-regular graphs
- Metric dimension of some distance-regular graphs
- Incidence matrices of finite attenuated spaces and class dimension of association schemes
- On the metric dimension of bilinear forms graphs
- On the metric dimension of imprimitive distance-regular graphs
- Mastermind
- Identifying codes in vertex-transitive graphs and strongly regular graphs
- On the order of uniprimitive permutation groups
- Metric dimension of symplectic dual polar graphs and symmetric bilinear forms graphs
- Resolving sets for Johnson and Kneser graphs
- Resolving sets and semi-resolving sets in finite projective planes
- Resolving the hypercube
- Smith's theorem and a characterization of the 6-cube as distance-transitive graph
- The metric dimension of small distance-regular and strongly regular graphs
- Base size, metric dimension and other invariants of groups and graphs
- On the Metric Dimension of Cartesian Products of Graphs
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- Resolving sets for four families of distance-regular graphs
- On the metric dimension of Grassmann graphs
- On Metric Generators of Graphs