Extremal digraphs avoiding distinct walks of length 4 with the same endpoints.

Published in: Discuss. Math. Graph Theory (2022)

Keyphrases

endpoints
minimal cost
line segments
graph theory
minimal path
directed graph
equivalence classes
closely related
fixed length
single valued
geodesic paths
medial axis
maximum number
continuous functions
total length