Algorithmic Aspects of k-Geodetic Sets in Graphs
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Graph, geodetic set, k-geodetic set, graph algorithmsAbstract
Let G be a connected graph of order $p\ge 2$. We study about the geodetic sets and k-geodetic sets of G. We study link vectors and prove a theorem to develop an algorithm to find the k-geodetic sets. Initially we study algorithms to find the closed interval between any two vertices of G and to find it's link vectors. In this paper we present two algorithms to check whether a given set of vertices is a k-geodetic set and to find the minimum k-geodetic set of G.
Downloads
Published
How to Cite
Issue
Section
License
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.