A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
On Cycle Related Graphs with Constant Metric Dimension
2012
Open Journal of Discrete Mathematics
Preserved Fulltext
If is a connected graph, the distance between two vertices G , is the length of a shortest path between them. Let be an ordered set of vertices of and let v be a vertex of . The representation *
doi:10.4236/ojdm.2012.21005
fatcat:baoumofyo5ayflozwpz7lxwjay