Back to Search
Start Over
Connected graphs without long paths
- Source :
-
Discrete Mathematics . Oct2008, Vol. 308 Issue 19, p4487-4494. 8p. - Publication Year :
- 2008
-
Abstract
- Abstract: We determine the maximum number of edges in a connected graph with n vertices if it contains no path with vertices. We also determine the extremal graphs. [Copyright &y& Elsevier]
- Subjects :
- *GRAPH theory
*GRAPHIC methods
*COMBINATORICS
*ALGEBRA
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 308
- Issue :
- 19
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 32735980
- Full Text :
- https://doi.org/10.1016/j.disc.2007.08.047