Some general constructions of geodetic blocks

DOI10.1016/0095-8956(82)90063-6zbMath0488.05056OpenAlexW2043366960MaRDI QIDQ1165873

S. Singh

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90063-6

zbMATH Keywords

diametergirthconstructiongeodetic blocksHoffman-Singleton graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99) Connectivity (05C40)

Related Items (10)

Drawing Shortest Paths in Geodetic Graphs ⋮ A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs ⋮ Unnamed Item ⋮ A note on 3-Steiner intervals and betweenness ⋮ Unnamed Item ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Geodetic blocks of diameter three ⋮ A new upper bound on the number of edges in a geodetic graph ⋮ An extremal problem in geodetic graphs ⋮ Drawing Shortest Paths in Geodetic Graphs

Cites Work

• On Moore Graphs with Diameters 2 and 3
• 1-Factors and Antifactor Sets
• On planar geodetic graphs
• Geodetic graphs of diameter two
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some general constructions of geodetic blocks