![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/9/96/Goldner-Harary_graph.svg/640px-Goldner-Harary_graph.svg.png&w=640&q=50)
K-tree
From Wikipedia, the free encyclopedia
In graph theory, a k-tree is an undirected graph formed by starting with a (k + 1)-vertex complete graph and then repeatedly adding vertices in such a way that each added vertex v has exactly k neighbors U such that, together, the k + 1 vertices formed by v and U form a clique.[1][2]
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/9/96/Goldner-Harary_graph.svg/320px-Goldner-Harary_graph.svg.png)