EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

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

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

International Journal of Mathematics and Mathematical Sciences · 2026-01 · 2026 (1)

DOI: 10.1155/ijmm/6398287 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Mathematics and Mathematical Sciences, online erschienen am 03.08.2026. Verfasst von A. Baniabedalruhman und 2 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 eg( G ). 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.

Zitieren

APA

Baniabedalruhman, A., Alkhamaiseh, B., & Jaradat, M. M. M. (2026). Computing Exact Edge Geodetic Numbers in K‐Powered Path and Cycle Graphs. International Journal of Mathematics and Mathematical Sciences, 2026(1). https://doi.org/10.1155/ijmm/6398287

Vancouver

Baniabedalruhman A, Alkhamaiseh B, Jaradat MMM. Computing Exact Edge Geodetic Numbers in K‐Powered Path and Cycle Graphs. International Journal of Mathematics and Mathematical Sciences. 2026;2026(1). doi:10.1155/ijmm/6398287

BibTeX
@article{Baniabedalruhman2026,
  author = {Baniabedalruhman, A. and Alkhamaiseh, Basem and Jaradat, M. M. M.},
  title = {Computing Exact Edge Geodetic Numbers in K‐Powered Path and Cycle Graphs},
  journal = {International Journal of Mathematics and Mathematical Sciences},
  year = {2026},
  volume = {2026},
  number = {1},
  doi = {10.1155/ijmm/6398287}
}
Kostenlos starten →