On Cycle Related Graphs with Constant Metric Dimension

Murtaza Ali, Gohar Ali, Usman Ali, M. T. Rahim
2012 Open Journal of Discrete Mathematics  
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