Article
Keywords:
extended tree; partition; vertex splitting; tree
Summary:
An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.