On the metric dimension of circulant and Harary graphs
Authors:
- Cyriac GrigoriousCGCyriac Grigorious
- Paul ManuelPMPaul Manuel
- Mirka MillerMMMirka Miller
- Bharati RajanBRBharati Rajan
- Sudeep StephenSSSudeep Stephen
- 1 December 2014
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 248, 47-54
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The metric dimension of the lexicographic product of graphsDiscrete Mathematics, 2013
- On the metric dimension of circulant graphsApplied Mathematics Letters, 2012
- An efficient representation of Benes networks and its applicationsJournal of Discrete Algorithms, 2008
- On minimum metric dimension of honeycomb networksJournal of Discrete Algorithms, 2008
- Landmarks in torus networksJournal of Discrete Mathematical Sciences and Cryptography, 2006
- On the metric dimension of some families of graphsElectronic Notes in Discrete Mathematics, 2005
- Landmarks in graphsDiscrete Applied Mathematics, 1996
- Reliable circulant networks with minimum transmission delayIEEE Transactions on Circuits and Systems, 1985
- Metric bases in digital geometryComputer Vision, Graphics, and Image Processing, 1984
- A Combinatorial Problem Related to Multimodule Memory OrganizationsJournal of the ACM, 1974