Many graph-theoretic concepts have both vertex and edge versions. Examples are cut-vertex , cut-edge , vertex-integrity ( integrity ), edge-integrity , vertex coloring , edge coloring , and vertex-connectivity , edge-connectivity . Frank Harary et al. defined the geodetic number of a graph for vertices in [Chartrand, G., Harary, F. and Zhang, P. (2002). On the geodetic number of a graph. Networks , 39 , 1-6; Chartrand, G., Harary, F. and Zhang, P. (2000). Geodetic sets in graphs. Discussions Mathematicae Graph Theory , 20 , 129-138; Harary, F., Loukakis, E. and Tsours, C. (1993). The geodetic number of a graph. Mathl. Comput. Modelling , 17 (11), 89-93]. In this study we give a definition of the edge geodetic number for a graph and derive some results.
On The Edge Geodetic Number Of A Graph
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related Research Data
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.