The Connectivities of Trunk Graphs of 2-Connected Graphs
by
Kiyoshi Yoshimoto
Department of Mathematics, Nihon University

Let G be a connected graph and V ^* set of all the spanning trees except stars in G. An edge in a spanning tree is called `inner' if the edge is not incident to endvertices. Define an adjacency relation in V ^* as follows; two spanning trees t₁ and t₂ in V ^* are called to be adjacent if there exist inner edges e_i in E(t_i) such that t₁-e₁=t₂ -e₂. The resultant graph is a subgraph of the tree graph of G, and we call it a trunk graph. In this talk, we consider the connectivities of a trunk graph.

http://www.math.cst.nihon-u.ac.jp/~yosimoto/

Date received: April 20, 2001