A tree-based multicast algorithm for wormhole-routed torus networks which makes use of multiple edge-disjoint spanning trees is presented. Techniques for constructing two edge-disjoint spanning trees in 2-dimensional tori are rst described and analyzed. The disjoint spanning-tree multi-cast (DSTM) algorithm which uses the two disjoint spanning trees together with an up-down routing strategy to ...

We study minimal spanning forests in infinite graphs, which are weak limits of minimal spanning trees from finite subgraphs corresponding to i.i.d. random labels on the edges. These limits can be taken with free or wired boundary conditions, and are denoted FMSF (free minimal spanning forest) and WMSF (wired minimal spanning forest), respectively. The WMSF is also the union of the trees that ar...

Let k be a non-negative integer. A branch vertex of a tree is a vertex of degree at least three. We show two sufficient conditions for a connected clawfree graph to have a spanning tree with a bounded number of branch vertices: (i) A connected claw-free graph has a spanning tree with at most k branch vertices if its independence number is at most 2k + 2. (ii) A connected clawfree graph of order...

MANET is an autonomous distributed system in which mobile nodes are of random nature. Establishing Connection among the nodes is a challenging issue. In this paper we have done a study on the various challenges of MANET which affects the performance of the network and by using spanning tree how it can be controlled. Spanning tree concept provides a loop free network where peer to peer connectio...