The purpose of this note is to give a local criterion for a graph to be a k-tree. We show that a connected graph with the right number of edges is a k-tree if and only if the neighbourhood of each vertex is a (k -l)-tree.
A characterization of bivariegated trees
β Scribed by A.R. Bednarek; E.L. Sanders
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 938 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
A @mph ix biwwiepted PO itr vertca; Jiet c"8n be partitioned into two equal sets such that e&t WPWQ is od@tuxnt to me and only one vertex in the set not containing it. A tree with 2~ verlh & bivaticgatcd Of an," mly if the largest indcpcndcnt subset of the vertex set hw uxdind n. A constructive description of such trees as well as a listing of all those with 12 of fimw vertices is $ven.
π SIMILAR VOLUMES
## Abstract A graph __G__ is a 2βtree if __G__β=β__K__~3~, or __G__ has a vertex __v__ of degree 2, whose neighbors are adjacent, and __G__/ __v__ is a 2β tree. A characterization of the degree sequences of 2βtrees is given. This characterization yields a linearβtime algorithm for recognizing and r
We use a combination of analytic models and computer simulations to gain insight into the dynamics of evolution. Our results suggest that certain interesting phenomena should eventually emerge from the fossil record. For example, there should be a "tortoise and hare effect": those genera with the sm