#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2014

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang
- Applied Mathematics and Computation
- 2015

- Jinn-Shyong Yang, Meng-Ru Wu, Jou-Ming Chang, Yu-Huei Chang
- The Journal of Supercomputing
- 2014

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)

- Yu-Huei Chang, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang
- 2014 IEEE 17th International Conference on…
- 2014

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)

- Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang, Yue-Li Wang
- J. Comb. Optim.
- 2017

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
- ›