From specialists in the field, you will learn about interesting connections and recent
developments in the field of graph theory by looking in particular at Cartesian products …

Connectivity of Cartesian products of graphs - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full …

In this paper, we consider two embedding problems in Cartesian product networks: one is
the pancycle problem, which involves embedding cycles of various lengths in the given …

OTIS networks are interconnection networks amenable to deployment as hybrid networks
containing both electronic and optical links. Deficiencies as regards symmetry led to the …

The problem of uniquely recognizing the position of an intruder in a network was the
principal motivation of introducing the concept of metric generators in graphs by Slater in …

Finding a Hamiltonian cycle in a graph G=(V, E) is a well-known problem. The challenge of
finding a Hamiltonian cycle that avoids these faults when faulty vertices or edges are present …

Abstract For integer\(k\geq 1\), a\((p, q)\)-graph\(G=(V, E)\) is said to admit an\(AL (k)\)-
traversal if there exist a sequence of vertices\(\left (v_1, v_2,\ldots, v_p\right)\) such that for …

Abstract In 1993, Fernandes and Kanevsky proposed an important structure for
interconnection networks, WKR Pyramid Networks (WKP (d, t, L), for short). These are …

A path factor in a graph $ G $ is a factor of $ G $ in which every component is a path on at
least two vertices. Let $ T\Box P_n $ be the Cartesian product of a tree $ T $ and a path on …

The idea of (combinatorial) Gray codes is to list objects in question in such a way that two
successive objects differ in some pre-specified small way. In this paper, we utilize β …