An extremal problem in geodetic graphs

DOI10.1016/0012-365X(84)90112-2zbMath0537.05029OpenAlexW1977813728MaRDI QIDQ792335

N. E. Zubov

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90112-2

zbMATH Keywords

diametergeodetic graphgeodetic blocksunique shortest path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (5)

Bigeodetic graphs ⋮ A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs ⋮ A note on 3-Steiner intervals and betweenness ⋮ Geodetic blocks of diameter three ⋮ A new upper bound on the number of edges in a geodetic graph

Cites Work

• Some general constructions of geodetic blocks
• A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares
• Parallel concepts in graph theory
• Geodetic orientations of complete \(k\)-partite graphs
• Geodetic graphs of diameter two
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An extremal problem in geodetic graphs