Reliability analysis based on the dual-CIST in shuffle-cubes

[1]  Jun-Ming Xu,et al.  The super connectivity of shuffle-cubes , 2005, Inf. Process. Lett..

[2]  Toru Hasunuma,et al.  Completely Independent Spanning Trees in Maximal Planar Graphs , 2002, WG.

[3]  Xiao-Wen Qin,et al.  The Existence of Completely Independent Spanning Trees for Some Compound Graphs , 2020, IEEE Transactions on Parallel and Distributed Systems.

[4]  Kung-Jui Pai,et al.  Dual-CISTs: Configuring a Protection Routing on Some Cayley Networks , 2019, IEEE/ACM Transactions on Networking.

[5]  Eddie Cheng,et al.  Matching Preclusion for the Shuffle-Cubes , 2018, Parallel Process. Lett..

[6]  Shuming Zhou,et al.  Conditional diagnosability and strong diagnosability of shuffle-cubes under the comparison model , 2015, Int. J. Comput. Math..

[7]  Kung-Jui Pai,et al.  Constructing two completely independent spanning trees in hypercube-variant networks , 2016, Theor. Comput. Sci..

[8]  Toru Araki,et al.  Dirac's Condition for Completely Independent Spanning Trees , 2014, J. Graph Theory.

[9]  Costas Busch,et al.  An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs , 2012, IEEE Transactions on Computers.

[10]  Ferenc Péterfalvi,et al.  Two counterexamples on completely independent spanning trees , 2012, Discret. Math..

[11]  Lixin Gao,et al.  On the Feasibility and Efficacy of Protection Routing in IP Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  Toru Hasunuma,et al.  Completely independent spanning trees in the underlying graph of a line digraph , 2000, Discret. Math..

[13]  Jimmy J. M. Tan,et al.  The shuffle-cubes and their generalization , 2001, Inf. Process. Lett..

[14]  Toru Hasunuma,et al.  Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees , 2015, IWOCA.

[15]  Jianxi Fan,et al.  Constructing completely independent spanning trees in crossed cubes , 2017, Discret. Appl. Math..

[16]  Toru Hasunuma,et al.  Completely independent spanning trees in torus networks , 2012, Networks.

[17]  Hung-Yi Chang,et al.  A Note on the Degree Condition of Completely Independent Spanning Trees , 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[18]  Yota Otachi,et al.  Completely Independent Spanning Trees in (Partial) k-Trees , 2015, Discuss. Math. Graph Theory.

[19]  Jou-Ming Chang,et al.  Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs , 2013 .

[20]  Qinghai Liu,et al.  Ore's condition for completely independent spanning trees , 2014, Discret. Appl. Math..

[21]  Hui Yu,et al.  The (t, k)-diagnosability of shuffle-cubes under PMC model , 2019, Int. J. Comput. Math. Comput. Syst. Theory.

[22]  János Tapolcai,et al.  Sufficient conditions for protection routing in IP networks , 2013, Optim. Lett..

[23]  Qinghai Liu,et al.  Degree condition for completely independent spanning trees , 2016, Inf. Process. Lett..

[24]  Jou-Ming Chang,et al.  Constructing dual-CISTs of DCell data center networks , 2019, Appl. Math. Comput..

[25]  Adele A. Rescigno,et al.  Optimally Balanced Spanning Tree of the Star Network , 2001, IEEE Trans. Computers.

[26]  Xiao-Dong Hu,et al.  The conditional diagnosability of shuffle-cubes , 2010, J. Syst. Sci. Complex..