Metric basis in circulant networks.
From MaRDI portal
Publication:4568205
zbMATH Open1413.05358MaRDI QIDQ4568205FDOQ4568205
Authors: Muhammad Naeem Azhar, Imran Javaid
Publication date: 15 June 2018
Recommendations
Cited In (10)
- On the metric dimension and diameter of circulant graphs with three jumps
- The metric dimension of the circulant graph \(C(n,\pm\{1,2,3,4\})\)
- Resolvability in subdivision of circulant networks \(C_n[1, k]\)
- On the metric dimension of circulant graphs
- Minimum metric dimension of Illiac networks.
- On minimum metric dimension of honeycomb networks
- On vertices contained in all or in no metric basis
- Computing a metric basis of a bipartite distance-hereditary graph
- Unique basis graphs.
- Resolvability in circulant graphs
This page was built for publication: Metric basis in circulant networks.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568205)