Computing exact edge geodetic numbers in k-powered path and cycle graphs

DOI10.1155/IJMM/6398287MaRDI QIDQ7356581zbMATH OpenFDO

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

Publication date 24 September 2026

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/IJMM/6398287

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Cites work

• Computational and structural aspects of the geodetic and the hull numbers of shadow graphs
• Edge geodetic number of a graph
• Geodetic numbers of tensor product and lexicographic product of graphs
• Monitoring edge-geodetic sets: hardness and graph products
• The connected edge geodetic number of a graph
• The upper edge geodetic number and the forcing edge geodetic number of a graph

This page was built for publication: Computing exact edge geodetic numbers in k-powered path and cycle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356581)