|
|||||
|
|
Connected graphs without long paths |
|
| Authors: | PN Balister J Lehel RH Schelp |
| Institution: | Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152-3240, USA |
| Abstract: | We determine the maximum number of edges in a connected graph with n vertices if it contains no path with k+1 vertices. We also determine the extremal graphs. |
| Keywords: | Extremal graph Path |
| 本文献已被 ScienceDirect 等数据库收录！ | |