• TOTAL RESOLVING NUMBER OF EDGE CYCLE GRAPHS G(C3)

J. PAULRAJ JOSEPH*, N. SHUNMUGAPRIYA

Abstract


Let G = (V, E) be a simple connected graph. An ordered subset W of V is said to be a resolving set of G if every vertex is uniquely determined by its vector of distances to the vertices in W. The minimum cardinality of a resolving set is called the resolving number of G and  is denoted by r(G).  Total resolving number as the minimum cardinality taken over all resolving sets in which   has no isolates and is denoted by tr(G). In this paper, we determine the exact values for the total resolving number of T(C3), Cn(C3) and Fs(C3). Also, we obtain bounds for the total resolving number of G(C3) and characterize the extremal graphs.


Keywords


resolving number, total resolving number, edge cycle graph.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2016 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter