Independent spanning trees on twisted cubes

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal

28 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)58-69
Journal / PublicationJournal of Parallel and Distributed Computing
Volume72
Issue number1
Publication statusPublished - Jan 2012

Abstract

Multiple independent spanning trees have applications to fault tolerance and data broadcasting in distributed networks. There are two versions of the n independent spanning trees conjecture. The vertex (edge) conjecture is that any n-connected (n-edge-connected) graph has n vertex-independent spanning trees (edge-independent spanning trees) rooted at an arbitrary vertex. Note that the vertex conjecture implies the edge conjecture. The vertex and edge conjectures have been confirmed only for n-connected graphs with n≤4, and they are still open for arbitrary n-connected graph when nQn by providing an O(NlogN) algorithm to construct n vertex-independent spanning trees rooted at any vertex, where N denotes the number of vertices in TQn. Moreover, all independent spanning trees rooted at an arbitrary vertex constructed by our construction method are isomorphic and the height of each tree is n+1 for any integer n

Research Area(s)

  • Broadcasting, Fault tolerance, Independent spanning tree, Twisted cube

Citation Format(s)

Independent spanning trees on twisted cubes. / Wang, Yan; Fan, Jianxi; Zhou, Guodong; Jia, Xiaohua.

In: Journal of Parallel and Distributed Computing, Vol. 72, No. 1, 01.2012, p. 58-69.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal