ICAR Research Data Repository for Knowledge Management
Non-separating trees in connected graphs
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
Non-separating trees in connected graphs
|
|
| Creator |
DIWAN, AA
THOLIYA, NP |
|
| Subject |
non-separating tree
isomorphic subtree minimum degree |
|
| Description |
Let T be any tree of order d >= 1. We prove that every connected graph G with minimum degree d contains a subtree T' isomorphic to T such that G - V(T') is connected. (C) 2009
|
|
| Publisher |
ELSEVIER SCIENCE BV
|
|
| Date |
2011-07-25T22:52:18Z
2011-12-26T12:50:46Z 2011-12-27T05:36:51Z 2011-07-25T22:52:18Z 2011-12-26T12:50:46Z 2011-12-27T05:36:51Z 2009 |
|
| Type |
Article
|
|
| Identifier |
DISCRETE MATHEMATICS, 309(16), 5235-5237
0012-365X http://dx.doi.org/10.1016/j.disc.2009.03.037 http://dspace.library.iitb.ac.in/xmlui/handle/10054/6806 http://hdl.handle.net/10054/6806 |
|
| Language |
en
|
|