|
|||||
|
|
A solution of Chartrand's problem on spanning trees |
|
| Authors: | Oai Maocheng |
| Affiliation: | (1) Institute of Applied Mathematics, Academia Sinica, China |
| Abstract: | It is proved that if a connected graphG contains two distinct spanning trees, then any two spanning trees ofG can be connected by a chain of spanning trees, in which any two consecutive treesT1 andTi+1 are adjacent, i.e., the symmetric differenceE(Ti)  E(Ti+1) consists of two adjacent edges. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |