In this note we give a construction for obtaining the maximum number of edge-disjoint spanning trees in a hypercube. The result has applications to multicast communication in wormhole-routed parallel computers
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of e...
[[abstract]]Abstract澤 Cartesian product network is obtained by applying the cross operation on two g...
Abstract—Independent spanning trees (ISTs) provide a number of advantages in data broadcasting. One ...
AbstractThe use of edge-disjoint spanning trees for data broadcasting and scattering problem in netw...
AbstractWe describe dense edge-disjoint embeddings of the complete binary tree with n leaves in the ...
AbstractWe construct a family of n spanning trees of the n-cube, called Dn, with the following prope...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
We show that the complete binary tree with n > 8 leaves can be embedded in the hypercube with n node...
In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs ...
AbstractWe prove that the d-dimensional hypercube, Qd, with n = 2d vertices, contains a spanning tre...
AbstractFault-tolerant broadcasting and secure message distribution are important issues for network...
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition sim...
[[abstract]]A Cartesian product network is obtained by applying the cross operation on two graphs. I...
[[abstract]]The use of multiple independent spanning trees (ISTs) for data broadcasting in networks ...
[[abstract]]The use of multiple independent spanning trees (ISTs) for data broadcasting in networks ...
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of e...
[[abstract]]Abstract澤 Cartesian product network is obtained by applying the cross operation on two g...
Abstract—Independent spanning trees (ISTs) provide a number of advantages in data broadcasting. One ...
AbstractThe use of edge-disjoint spanning trees for data broadcasting and scattering problem in netw...
AbstractWe describe dense edge-disjoint embeddings of the complete binary tree with n leaves in the ...
AbstractWe construct a family of n spanning trees of the n-cube, called Dn, with the following prope...
AbstractIt is shown that an n-edge connected graph has at least ⌈(n − 1)2⌉ pairwise edge-disjoint sp...
We show that the complete binary tree with n > 8 leaves can be embedded in the hypercube with n node...
In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs ...
AbstractWe prove that the d-dimensional hypercube, Qd, with n = 2d vertices, contains a spanning tre...
AbstractFault-tolerant broadcasting and secure message distribution are important issues for network...
The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition sim...
[[abstract]]A Cartesian product network is obtained by applying the cross operation on two graphs. I...
[[abstract]]The use of multiple independent spanning trees (ISTs) for data broadcasting in networks ...
[[abstract]]The use of multiple independent spanning trees (ISTs) for data broadcasting in networks ...
The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of e...
[[abstract]]Abstract澤 Cartesian product network is obtained by applying the cross operation on two g...
Abstract—Independent spanning trees (ISTs) provide a number of advantages in data broadcasting. One ...
DOI
Add to ORKG