Title of article
Non-separating trees in connected graphs
Author/Authors
Diwan، نويسنده , , Ajit A. and Tholiya، نويسنده , , Namrata P.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
3
From page
5235
To page
5237
Abstract
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.
Keywords
Isomorphic subtree , Non-separating tree , minimum degree
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1599050
Link To Document