Abstract
A graph G is called strongly geodetic if two arbitrary vertices are connected by at most one path of length less than or equal to the diameter of G. It is proved that a strongly geodetic graph is either a forest or a regular graph with a finite diameter. Further, regular strongly geodetic graphs with finite diameters (so-called tied graphs) are studied in detail.
Sign-in/Register to access full text options 
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.
