Computing Exact Edge Geodetic Numbers in K-Powered Path and Cycle Graphs

A. Baniabedalruhman, Basem Alkhamaiseh and M. M. M. Jaradat

International Journal of Mathematics and Mathematical Sciences, 2026, vol. 2026, 1-6

Abstract: For any two vertices u and v in a graph G, u−v geodesic is the shortest path between u and v. A set S of vertices in G is called an edge geodetic cover for G if every edge in G belongs to a geodesic between two vertices of S. The minimum cardinality of an edge geodetic cover is called the edge geodetic number and is denoted by egG. In this paper, we determine the exact edge geodetic number of k-powered paths and k-powered cycles. The proofs rely on a careful characterization of semiextreme vertices and geodesic covering arguments. The obtained results extend previous work on edge geodetic parameters and provide new insights into metric properties of graph powers.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ijmms/2026/6398287.pdf (application/pdf)
http://downloads.hindawi.com/journals/ijmms/2026/6398287.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:6398287

DOI: 10.1155/ijmm/6398287

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().