K-tree
id:
k-tree-289-5887701
title:
K-tree
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/K-tree
date created:
date modified:
2024-01-14T00:12:10Z
main entity:
{"identifier":"Q12027616","url":"https://www.wikidata.org/entity/Q12027616"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/96/Goldner-Harary_graph.svg","width":520,"height":320}
fields total:
13
integrity:
14