A new upper bound on the number of edges in a geodetic graph

DOI10.1016/S0012-365X(98)00353-7zbMath0930.05053OpenAlexW2163226167WikidataQ127628851 ScholiaQ127628851MaRDI QIDQ1301713

Jingzhong Mao, Deying Li

Publication date: 29 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00353-7

zbMATH Keywords

upper boundnumber of edgescentral geodetic block

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items

On the mutual visibility in Cartesian products and triangle-free graphs

Cites Work

• Unnamed Item
• An extremal problem in geodetic graphs
• Some general constructions of geodetic blocks
• On planar geodetic graphs
• Geodetic graphs of diameter two

This page was built for publication: A new upper bound on the number of edges in a geodetic graph