K-Distance Facility Set of a Graph
Abstract
A set is called a -distance facility set of if any geodesic joining and of length at least , contains some as an internal vertex of or where and . The minimum cardinality of a -distance facility set of is called minimum -distance facility set of (in short -set) and the minimum cardinality is called the -distance facility number of is denoted by . In this paper we found relation between and other graph theoretic parameters, also we found the -distance facility number of paths, cycles and trees.
Published
2020-04-19
How to Cite
R. Ananthakumar. (2020). K-Distance Facility Set of a Graph . International Journal of Advanced Science and Technology, 29(7s), 1122 - 1128. Retrieved from http://sersc.org/journals/index.php/IJAST/article/view/10630
Section
Articles