Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

Constructing vertex-disjoint paths in (n, k)-star graphs

Information Sciences: an International Journal

Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

Information Processing Letters

Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs

Information Processing Letters

Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

Discrete Applied Mathematics

Fault tolerance in bubble-sort graph networks

Theoretical Computer Science

An algorithm to construct independent spanning trees on parity cubes

Theoretical Computer Science

Construction of optimal independent spanning trees on folded hypercubes

Information Sciences: an International Journal