Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
Degree conditions for forests in graphs
Ch. Sobhan Babu
,
A.A. Diwan
Published in
2005
DOI:
10.1016/j.disc.2005.08.001
Volume: 301
Issue: 2-3
Pages: 228 - 231
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. © 2005 Elsevier B.V. All rights reserved.
Download
PDF
Postprint
Cite
Postprint Version
Content may be subject to copyright,
Check License
© This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc... ...
© This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/
PDF
Journal Details
Authors (1)
About the journal
Journal
Discrete Mathematics
ISSN
0012365X
Authors (1)
Ch. Sobhan Babu
Department of Computer Science and Engineering
Recent publications
Detection of motorcyclists without helmet in videos using convolutional neural network
Human Fall Detection in Surveillance Videos Using Fall Motion Vector Modeling
REMP software to introduce a screening REstriction site in site-directed Mutagenesis Primer
Optimal don’t care filling for minimizing peak toggles during at-speed stuck-at testing
Get all the updates for this publication
Follow