Resolvability in subdivision of circulant networks C_n[1, k]
From MaRDI portal
Publication:2004177
DOI10.1155/2020/4197678zbMATH Open1459.05069OpenAlexW3088316435MaRDI QIDQ2004177FDOQ2004177
M. Imran, Syed Ahtsham Ul Haq Bokhary, Jianxin Wei, Ghulam Abbas
Publication date: 14 October 2020
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/4197678
Recommendations
Cites Work
- Title not available (Why is that?)
- Resolvability in graphs and the metric dimension of a graph
- On classes of regular graphs with constant metric dimension
- On families of convex polytopes with constant metric dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the metric dimension of circulant graphs
- On \(k\)-dimensional graphs and their bases
- On metric dimension of flower graphs \(f_{n \times m}\) and convex polytopes
- Metric bases in digital geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- The metric dimension of Cartesian products of graphs
- On Metric Generators of Graphs
- Title not available (Why is that?)
- The Metric Dimension of Circulant Graphs
- Title not available (Why is that?)
- The metric dimension of circulant graphs and their Cartesian products
- On resolvability of a graph associated to a finite vector space
- Title not available (Why is that?)
- On the metric dimension of barycentric subdivision of Cayley graphs \(\mathrm{Cay}(Z_{n}\oplus Z_{m})\)
- The metric dimension of the circulant graph $C(n,\pm\{1,2,3,4\})$
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Resolvability in subdivision of circulant networks \(C_n[1, k]\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004177)
