Yu-Huei Chang

  • Citations Per Year
Learn More
A set of spanning trees in a graph is said to be independent (ISTs for short) if all the trees are rooted at the same node $$r$$ r and for any other node $$v(\ne r)$$ v ( ≠ r ) , the paths from $$v$$ v to $$r$$ r in any two trees are node-disjoint except the two end nodes $$v$$ v and $$r$$ r . It was conjectured that for any $$n$$ n -connected graph there(More)
Zehavi and Itai (1989) proposed the following conjecture: every k-connected graph has k independent spanning trees (ISTs for short) rooted at an arbitrary node. An n-dimensional parity cube, denoted by PQn, is a variation of hyper cubes with connectivity n and has many features superior to those of hyper cubes. Recently, Wang et al. (2012) confirm the ISTs(More)
Let LTQn denote the n-dimensional locally twisted cube. Hsieh and Tu (2009) [13] presented an algorithm to construct n edge-disjoint spanning trees rooted at vertex 0 in LTQn. Later on, Lin et al. (2010) [23] proved that Hsieh and Tu’s spanning trees are indeed independent spanning trees (ISTs for short), i.e., all spanning trees are rooted at the same(More)
  • 1