Edge geodetic number of a graph

DOI10.1080/09720529.2007.10698129MaRDI QIDQ5421205zbMATH OpenOpenAlexFDO

Authors

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 coveredge geodetic number

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• On The Edge Geodetic Number Of A Graph
• Edge geodetic covers in graphs
• The connected edge geodetic number of a graph
• Geodesic graphoidal covering number of a graph
• The k-edge geodetic number of a graph

Cites work

• Graphs with specified radius and diameter
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• On the geodetic number of a graph
• The Steiner number of a graph

Cited in

(34)

• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• The 2-edge geodetic number and graph operations
• Strong edge geodetic problem on grids
• Strong edge geodetic problem in networks
• On the approximation hardness of geodetic set and its variants
• Comment on ``Edge geodetic covers in graphs
• Linear edge geodetic graphs
• scientific article; zbMATH DE number 5834292 (Why is no real title available?)
• Edge geodetic covers in graphs
• scientific article; zbMATH DE number 1292538 (Why is no real title available?)
• On The Edge Geodetic Number Of A Graph
• Distinct edge geodetic decomposition in graphs
• The forcing near geodetic number of a graph
• The edge signal number of a graph
• The near geodetic number of a graph
• STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS
• On the edge geodetic and edge geodetic domination numbers of a graph
• Geodesic graphoidal covering number of a graph
• scientific article; zbMATH DE number 5022934 (Why is no real title available?)
• Edge geodetic self-decomposition in graphs
• The edge Steiner number of a graph
• The Connected Edge-To-Vertex Geodetic Number of a Graph
• 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
• Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
• Edge geodetic sequence in graphs
• The extreme vertices of superpower graph of group S_n
• Monitoring edge-geodetic sets in graphs
• Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
• The edge geodetic fault tolerant domination number of a graph
• Algorithms and complexity for monitoring edge-geodetic sets in graphs
• Computing exact edge geodetic numbers in k-powered path and cycle graphs

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

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