Title of article
Paths of length four
Author/Authors
Béla Bollob?s، نويسنده , , Amites Sarkar، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
7
From page
357
To page
363
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).
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949104
Link To Document