The geodetic numbers of graphs and digraphs

DOI10.1007/s11425-007-0048-xzbMath1127.05031OpenAlexW2035310633MaRDI QIDQ2461517

Chang-hong Lu

Publication date: 28 November 2007

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-0048-x

zbMATH Keywords

digraphdistancegeodesicconvex setgeodetic number

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ Strong geodetic problem on Cartesian products of graphs ⋮ On the geodetic number of median graphs

Cites Work

• The hull number of a graph
• Convexity in graphs
• Geodetic spectra of graphs.
• The geodetic number of an oriented graph
• On the geodetic number of a graph
• The forcing geodetic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The geodetic numbers of graphs and digraphs