Leaf power
id:
leaf-power-270-386600
title:
Leaf power
text:
In the mathematical area of graph theory, a k-leaf power of a tree T is a graph G whose vertices are the leaves of T and whose edges connect pairs of leaves whose distance in T is at most k. That is, G is an induced subgraph of the graph power T k , induced by the leaves of T. For a graph G constructed in this way, T is called a k-leaf root of G. A graph is a leaf power if it is a k-leaf power for some k. These graphs have applications in phylogeny, the problem of reconstructing evolutionary tre
brand slug:
wiki
category slug:
encyclopedia
description:
Graph representing leaves of a given tree graph
original url:
https://en.wikipedia.org/wiki/Leaf_power
date created:
date modified:
2024-01-05T09:49:56Z
main entity:
{"identifier":"Q25304867","url":"https://www.wikidata.org/entity/Q25304867"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d5/3-leaf_power.svg","width":468,"height":333}
fields total:
13
integrity:
15