Geodetic spectra of graphs.

DOI10.1016/j.ejc.2003.09.010zbMath1034.05018OpenAlexW2022498946MaRDI QIDQ1427436

Li-Da Tong, Hong-Tsu Wang, Gerard Jennhwa Chang

Publication date: 14 March 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.09.010

zbMATH Keywords

Complete graphTreeConnected graphCycleConvex setGeodesicComplete \(r\)-partite graphGeodetic number

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (4)

PATH-INDUCED CLOSED GEODETIC NUMBERS OF SOME GRAPHS ⋮ The geodetic numbers of graphs and digraphs ⋮ On pitfalls in computing the geodetic number of a graph ⋮ Strong geodetic problem in networks

Cites Work

• The hull number of a graph
• Convexity in 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

This page was built for publication: Geodetic spectra of graphs.