The growing complexity and dependability requirements of hardware, software, and
networks demand efficient techniques for discovering disruptive behavior in those systems …

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining
k distinct source-sink pairs in which each vertex of G is covered by a path. We deal with the …

A subset of vertices X is said to be a cutset if G− X is not connected. A cutset X is called an
Rg-cutset if every component of G− X has at least g+ 1 vertices. If G has at least one Rg …

Given a connected graph G and a non-negative integer g, the g-extra connectivity κ g (G) of
G is the minimum cardinality of a set of vertices in G, if it exists, whose deletion disconnects …

In this paper, we deal with the graph G0⊕ G1 obtained from merging two graphs G0 and G1
with n vertices each by n pairwise nonadjacent edges joining vertices in G0 and vertices in …

We call a graph G to be f-fault Hamiltonian (resp. f-fault Hamiltonian-connected,) if there
exists a Hamiltonian cycle (resp. if each pair of vertices are joined by a Hamiltonian path) in …

We define a new class of graphs by generalizing the hypercube-like networks to folded
hypercube-like networks FH n. We also investigate the reliability of this class of graphs in …

Hamiltonian properties of hypercube variants are explored. Variations of the hypercube
networks have been proposed by several researchers. In this paper, we show that all …

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining
k sources and k sinks in which each vertex of G is covered by a path. It is called a paired …

The matching preclusion problem, introduced by Brigham et al.[RC Brigham, F. Harary, EC
Violin, and J. Yellen, Perfect-matching preclusion, Congressus Numerantium 174 (2005) …