The problem of constructing independent spanning trees (ISTs) dates back to as early as the
late 1980s. Given a network G of a certain topology, the question is whether we can, as well …

The connectivity and the spanning tree packing number of a graph are two important
measurements for the fault-tolerance of a network. The generalized connectivity is a …

Given two regular graphs G and H such that the vertex degree of G is equal to the number of
vertices in H, the compound graph G (H) is constructed by replacing each vertex of G by a …

Abstract The Completely Independent Spanning Trees (CISTs) are a very useful construct in
a computer network. It can find applications in many important network functions, especially …

Fault-tolerant broadcasting and secure message distribution are important issues for
network applications. It is a common idea to design multiple spanning trees with a specific …

Motivated by evaluating the reliability and fault tolerance of a network, we consider edge-
disjoint paths in augmented cubes with faulty edges. We show that for any faulty edge set …

The independent spanning trees (ISTs) problem attempts to construct a set of pairwise
independent spanning trees and it has numerous applications in networks such as data …

The spanning trees T 1, T 2,…, T k of G are edge-disjoint spanning trees (EDSTs) if they are
pairwise edge-disjoint. In addition to it if they are pairwise internally vertex disjoint then they …

Independent spanning trees (ISTs) on networks have applications in networks such as
reliable communication protocols, the multi-node broadcasting, one-to-all broadcasting …

Diagnosability of a multiprocessor system is one important measure of the reliability of
interconnection networks. In 2012, Peng et al. proposed the g-good-neighbor diagnosability …