MORE RESULTS ON NON-ISOLATED RESOLVING NUMBER OF A GRAPH
- 1. Research Department of Mathematics, Virudhunagar Hindu Nadars' Senthikumara Nadar College, Virudhunagar, Tamilnadu
Description
Let be a connected graph. Let be a subset of with an order imposed on it. For any , the vector is called the metric representation of with respect to . If distinct vertices in have distinct metric representation, then is called a resolving set of . The minimum cardinality of a resolving set of is called the metric dimension of and it is denoted by . A resolving set is called a non-isolated resolving set if the induced sub graph has no isolated vertices. The minimum cardinality of a non-isolated resolving set of is called the non-isolated resolving number of and is denoted by . In this paper, we determine the non-isolated resolving number for some standard graphs like double broom, the join of complete graphs and paths, etc. Further more, we discuss about the relationship of with other parameters.
Files
ICATAM-009.pdf
Files
(475.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:e335bbeef7e5787163edb497f907fd2e
|
475.4 kB | Preview Download |
Additional details
References
- 1. Selvam Avadayappan, M. Bhuvaneshwari, P. Jeya Bala Chitra, Non-isolated Resolving Number of a Graph (Submitted). 2. Z. Beuliova, F. Eberhard, T. Erlebach, A. Hall, M. Hoffman, M. Mihalak, L. Ram, Network Discovery and Verification, IEEE J. Sel. Areas commun., 24 (2006) 2168-2181. 3. G. Chartrand, L. Eroh, M. Johnson, O.R. Oellermann, Resolvability in graphs and the metric dimension of a graph, Discrete Appl. Math., 105 (2000) 99-113. 4. G. Chartrand and L. Lesniak, Graphs and Digraphs, 3rd ed., chapman and Hall, London, (1996). 5. G. Chartrand, P. Zhang, The theory and application of resolvability in graphs: a survey, Congr. Numer., 160 (2003) 47-68. 6. Gary Chartrand and Ping zhang, Chromatic Graph Theory, press, Taylor and Francis Group, New York, (2009). 7. V. Chavatal, Mastermind, combinatorica, 3 (1983) 325-329. 8. F. Harary, R.A. Melter, On the metric dimension of a graph, Ars. Combin., 2 (1976) 191-195. 9. P. Jeya Bala chitra, S. Arumugam, Resolving Sets without Isolated Vertices, Procedia Computer Science, 74 (2015) 38-42. 10. S. Khuller, B. Raghavachari, A. Rosenfield, Landmarks in graphs, Discrete Appl. Math., 70 (1996) 217-229. 11. V. Saenpholphat and Ping Zhang, Connected Resolvability of graphs, Czechoslovak Mathematical Journal, 53 (2003), 827-840. 12. A. Sebo, E. Tannier, On metric generators of graphs, Math. Oper. Res, 29 (2004) 383-393. 13. Shahida. A. T, M. S. Sunitha, On the Metric dimension of Joins of Two Graphs, International Journal of Scientific and Research, vol. 5, 9 (2014) 2229-5518. 14. P.J. Slater, Leaves of Trees, Congr. Numer., 14 (1975) 549-559. 15. P.J. Slater: Dominating and reference sets in graphs, J. Math. Phys. Sci., 22 (1988) 445-455.