Geodetic graphs of diameter two

DOI10.1007/BF00191941zbMath0667.05037MaRDI QIDQ5903898

Andries E. Brouwer, Aart Blokhuis

Publication date: 1988

Published in: Geometriae Dedicata (Search for Journal in Brave)

zbMATH Keywords

geodetic graphsunique shortest path

Mathematics Subject Classification ID

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

Related Items

ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS, The independence number for polarity graphs of even order planes, Geodesic geometry on graphs, Universality vs genericity and \(C_4\)-free graphs, Irreducible nonmetrizable path systems in graphs, Computing dense and sparse subgraphs of weakly closed graphs, Graphs with convex balls, On the connectivity and diameter of geodetic graphs, Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes, Strong geodetic cores and Cartesian product graphs, Steiner intervals, geodesic intervals, and betweenness, Hyperbolic bridged graphs