论文信息 - On Central Spanning Trees of a Graph

On Central Spanning Trees of a Graph

We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning trees is minimal. We prove that the problem of constructing a central spanning tree is algorithmically difficult and leads to an NP-complete problem.

Sergei L. Bezrukov | Werner Poguntke | Firoz Kaderali

[1] Narsingh Deo. A Central Tree , 1966 .

[2] Frank Harary,et al. Graph Theory , 2016 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] Shoji Shinoda,et al. On central trees of a graph , 1980, Graph Theory and Algorithms.

[5] Y. Kajitani,et al. Maximally Distant Trees and Principal Partition of a Linear Graph , 1969 .

[6] Yoji Kajitani,et al. A new method of circuit analysis and central trees of a graph , 1983 .

[7] G. Cottafava,et al. Invariance properties of central trees , 1971 .