Edge geodetic number of a graph

DOI10.1080/09720529.2007.10698129zbMath1133.05028OpenAlexW2026546284MaRDI QIDQ5421205

No author found.

Publication date: 22 October 2007

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2007.10698129

zbMATH Keywords

edge geodetic numberedge geodetic cover

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (17)

Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ The near geodetic number of a graph ⋮ STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS ⋮ Strong edge geodetic problem in networks ⋮ The 2-edge geodetic number and graph operations ⋮ Algorithms and complexity for geodetic sets on partial grids ⋮ Monitoring edge-geodetic sets: hardness and graph products ⋮ Monitoring edge-geodetic sets in graphs ⋮ THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH ⋮ On the approximation hardness of geodetic set and its variants ⋮ The edge Steiner number of a graph ⋮ Strong edge geodetic problem on grids ⋮ The forcing near geodetic number of a graph ⋮ Comment on "Edge Geodetic Covers in Graphs ⋮ Edge geodetic self-decomposition in graphs ⋮ On the edge geodetic and edge geodetic domination numbers of a graph ⋮ Distinct edge geodetic decomposition in graphs

Cites Work

• Unnamed Item
• Graphs with specified radius and diameter
• On the geodetic number of a graph
• The Steiner number of a graph

This page was built for publication: Edge geodetic number of a graph