Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9512188 | Discrete Mathematics | 2005 | 4 Pages |
Abstract
If H is any forest of order n with m edges, then any graph G of order ⩾n with d(u)+d(v)⩾2m-1 for any two non-adjacent vertices u,v contains H.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ch. Sobhan Babu, Ajit A. Diwan,