Edge-independent spanning trees in augmented cubes
Authors:
- Yan WangYWYan Wang
- Hong ShenHSHong Shen
- Jianxi FanJFJianxi Fan
- 1 March 2017
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 670, 23-32
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61303205, 61572337)
- China Scholarship Council
- Australian Research Council (DP150104871)
This publication has 25 references indexed in Scilit:
- A comment on “Independent spanning trees in crossed cubes”Information Processing Letters, 2014
- Independent spanning trees in crossed cubesInformation Sciences, 2013
- Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubesThe Journal of Supercomputing, 2013
- Constructing edge-disjoint spanning trees in locally twisted cubesTheoretical Computer Science, 2009
- Fault hamiltonicity of augmented cubesParallel Computing, 2005
- Augmented cubesNetworks, 2002
- On edge-disjoint spanning trees in hypercubesInformation Processing Letters, 1999
- Reliable broadcasting in product networksDiscrete Applied Mathematics, 1998
- Edge-disjoint spanning trees on the star network with applications to fault toleranceIEEE Transactions on Computers, 1996
- Independent trees in graphsGraphs and Combinatorics, 1994