Abstract
A set of vertices D of a graph G is geodetic if every vertex of G lies in a shortest path between two vertices in D. The geodetic number of G is the minimum cardinality of a geodetic set of G, and deciding whether it is at most k is an NP-complete problem for several classes of graphs. While the problem is easy for graphs of maximum degree at most 2, we show that the problem is NP-complete for graphs of maximum degree three.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
