Title

Paths of length four

Abstract

For each sufficiently large m, we determine the unique graph of size m with the maximum number of paths of length four. If m is even, this is the complete bipartite graph K(m/2,2). © 2003 Elsevier Science B.V.

Publication Title

Discrete Mathematics

Share

COinS