The diagnosis of faulty processors plays an important role in multiprocessor systems for
reliable computing, and the diagnosability of many well-known networks has been explored …

The star graph interconnection network has been introduced as an attractive alternative to
the hypercube network. In this paper, we consider the path embedding problem in star …

Two Hamiltonian paths are said to be fully independent if the i th vertices of both paths are
distinct for all i between 1 and n, where n is the number of vertices of the given graph …

The hypercube family Q n is one of the most well-known interconnection networks in parallel
computers. With Q n, dual-cube networks, denoted by DC n, was introduced and shown to …

Two hamiltonian paths P1=〈 v1, v2,…, vn (G)〉 and P2=〈 u1, u2,…, un (G)〉 of G are
independent if v1= u1, vn (G)= un (G), and vi≠ ui for 1< i< n (G). A set of hamiltonian paths …

A hamiltonian cycleC of a graph G is an ordered set〈 u1, u2,…, un (G), u1〉 of vertices such
that ui≠ uj for i≠ j and ui is adjacent to ui+ 1 for every i∈{1, 2,…, n (G)− 1} and un (G) is …

The star graph is viewed as an attractive alternative to the hypercube. In this paper, we
investigate the Hamiltonicity of an n-dimensional star graph. We show that for any n …

Let G=(V, E) be a graph of order n. A Hamiltonian cycle of G is a cycle that contains every
vertex in G. Two Hamiltonian cycles C 1=< u 1, u 2,< cd02144. gif>, un, u 1> and C 2=< v 1, v …

Pressure ulcer is a severe threat for immobilized and peripheral neuropathic patients such
as bed-ridden, elderly, and diabetics. Once developed, the complication of pressure ulcer …

The alternating group graph has been used as the underlying topology for many practical
multicomputers, and has been extensively studied in the past. In this article, we will show …