Title of article
On spanning 2-trees in a graph Original Research Article
Author/Authors
Leizhen Cai، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
14
From page
203
To page
216
Abstract
A k-tree is either a complete graph on k vertices or a graph T that contains a vertex whose neighbourhood in T induces a complete graph on k vertices and whose removal results in a k-tree. A subgraph of a graph is a spanning k-tree if it is a k-tree and contains every vertex of the graph.
Keywords
Graph theory and algorithm , Spanning tree , Locally connected spanning tree , Tree 2-spanner , Spanning k-tree
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884518
Link To Document