With the need for large-scale networks evolving in a variety of fields, such as cloud/edge
computing, social networks, privacy protection, etc., the network's robustness against faulty …

Multiple edge-disjoint Hamiltonian cycles (EDHCs) provide the advantages of data
broadcast in parallel and edge fault-tolerance in network communications. This paper …

The connectivity of a connected graph G is the minimum cardinality over all vertex-cuts,
which can be determined using Menger's theorem (1927). Then G is super connected if its …

A graph is two-disjoint-cycle-cover-pancyclic if for any integer satisfying, there exist two
vertex-disjoint cycles and in such that the lengths of and are and, respectively, where …

The n-dimensional hypercube network Qn is one of the most popular interconnection
networks since it has simple structure and is easy to implement. The n-dimensional …

The presence of edge-disjoint Hamiltonian cycles provides an advantage when
implementing algorithms that require a ring structure by allowing message traffic to be …

The spined cube SQ n, as a variant network of the hypercube Q n, was proposed in 2011
and has attracted much attention because of its smaller diameter. It is well-known that Q n is …

The n-dimensional crossed cube CQ n, a variation of the hypercube Q n, has the same
number of vertices and the same number of edges as Q n, but it has only about half of the …

In this paper, we first introduce a family of interconnection network topologies, named disc-
ring graphs. Disc-ring graphs possess many desirable topological properties in building …

A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x and y
of G, it contains a Hamiltonian cycle C such that dC (x, y)= l for any integer l satisfying dG (x …