On D-Distance and D-Closed Graphs
DOI:
https://doi.org/10.12723/mjs.sp1.15Keywords:
D-distance, D-boundary vertex, D-interior vertex, D-null vertex, D-closure, D-closed graphsAbstract
This paper studies the concepts of D-boundary vertex, D-interior vertex, D-null vertex, D-closure of a graph and D-closed graph, based on the idea of D-distance. We investigate the structural properties of these concepts and determine whether some special classes of graphs are D-closed or not.
References
G. Chartrand, P. Zhang, Introduction to Graph Theory, Tata McGraw Hill Edition, 2006.
F. Harary , Graph Theory, Addison-Wesley, Boston, 1969.
D. Reddy Babu, P.L.N. Varma, D-distance in graphs, Golden Research Thoughts, Vol. 2, pp.56-58, 2013.
D. Reddy Babu, and P. L. N. Varma, Average D-Distance Between Edges of a Graph, Indian Journal of Science and Technology, vol.8, No.2, pp.152-156, 2015,.
Simmons George F, Introduction to Topology and Modern analysis, Mc Graw Hill, 1963.
M. Suresh, V. Mohanaselvi, Mean vertex D- distance for radial and detour radial graphs, AIP Conference Proceedings, Vol.2112, pp.1-6, 2019.
Additional Files
Published
Issue
Section
License
Copyright (c) 2023 Sunil M. P, Dr. J Suresh Kumar
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
