|
DSpace at King Saud University >
King Saud University >
COLLEGES >
Science Colleges >
College of Science >
College of Science >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/10919
|
| Title: | Maximum graphs not spannable by r disjoint paths |
| Authors: | M. Alabdullatif
K. Walker |
| Keywords: | Graphs
Spanning paths
Hamiltonian graphs
Extremal graphs |
| Issue Date: | 1999 |
| Publisher: | Discrete Mathematics |
| Citation: | 208/209 (1999) 9-12 |
| Abstract: | For each n and for each r6n − 3 we obtain the maximum number of edges of a connected
graph with n vertices which cannot be spanned by r disjoint paths. We also obtain all connected
graphs which achieve the maximum, of which there are two types. c 1999 Elsevier Science
B.V. All rights reserved. |
| URI: | http://hdl.handle.net/123456789/10919 |
| Appears in Collections: | College of Science
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
