TY - JOUR
AU - R. Ananthakumar ,
PY - 2020/04/19
Y2 - 2021/09/29
TI - K-Distance Facility Set of a Graph
JF - International Journal of Advanced Science and Technology
JA - IJAST
VL - 29
IS - 7s
SE - Articles
DO -
UR - https://sersc.org/journals/index.php/IJAST/article/view/10630
SP - 1122 - 1128
AB - 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.
ER -