Hierarchical graph: различия между версиями

and the leaves of <math>T</math> are exactly the trivial subgraphs of <math>G</math>

is called a '''clustered graph'''.