Record Details

Degree conditions for forests in graphs

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Degree conditions for forests in graphs
 
Creator BABU, CHSOBHAN
DIWAN, AJIT A
 
Subject numerical analysis
mathematical operators
 
Description 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.
 
Publisher Elsevier
 
Date 2009-05-10T08:52:51Z
2011-12-08T07:06:34Z
2011-12-26T13:01:58Z
2011-12-27T05:47:46Z
2009-05-10T08:52:51Z
2011-12-08T07:06:34Z
2011-12-26T13:01:58Z
2011-12-27T05:47:46Z
2005
 
Type Article
 
Identifier Discrete Mathematics 301(2-3), 228-231
0012-365X
10.1016/j.disc.2005.08.001
http://hdl.handle.net/10054/1334
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1334
 
Language en