OFFSET
1,3
COMMENTS
A graph is geodetic if each pair of vertices is joined by a unique shortest path. To obtain this sequence, non-isomorphic graphs were generated using Brendan McKay's nauty program, then the geodetic property is checked on this output.
LINKS
Brendan McKay and Adolfo Piperno, nauty and Traces. [nauty and Traces are programs for computing automorphism groups of graphs and digraphs.]
K. R. Parthasarathy and N. Srinivasan, Some general constructions of geodetic blocks, Journal of Combinatorial Theory, Series B (33) Issue 2, October 1982, pp. 121-136.
Florian Stober and Armin Weiß, Geodetic Graphs: Experiments and New Constructions, arXiv:2308.08970 [math.CO], 2023.
Eric Weisstein's World of Mathematics, Geodetic Graph
Wikipedia, Geodetic graph
EXAMPLE
For n=4 there are a(4)=4 geodetic graphs: a triangle with another edge attached to one vertex, an edge path of length 3, a tripod of 3 edges joined at a common vertex, and a complete graph on 4 vertices.
o
o o /|\
/ \ | o-|-o
o-o---o, o-o-o-o, o-o-o, \|/
o
PROG
(Sage) See A337178.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
John Cu and Murray Elder, Jan 28 2021
EXTENSIONS
a(12)-a(22) from Florian Stober and Armin Weiß added by Murray Elder, Nov 14 2023
STATUS
approved