相关论文: Constructing Two Edge-Disjoint Hamiltonian Cycles …

In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this…

An Any graph obtained by deleting a Hamming code of length n from a n-cube Qn is called as a Hamming shell. It is well known that a Hamming shell is vertex-transitive, edge-transitive, distance preserving. Moreover, it is Hamiltonian and…

In 2007, Arkin et al. initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They…

Barnette conjectured that all cubic $3$-connected plane graphs with maximum face size at most $6$ are hamiltonian. We provide a method of construction of a hamiltonian cycle (in dual terms) in an arbitrary cubic, $3$-connected plane graph…

In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every \alpha > 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 + \alpha)n contains at least n/8…

In an $r$-uniform hypergraph on $n$ vertices a tight Hamilton cycle consists of $n$ edges such that there exists a cyclic ordering of the vertices where the edges correspond to consecutive segments of $r$ vertices. We provide a first…

The 2-block intersection graph (2-BIG) of a twofold triple system (TTS) is the graph whose vertex set is composed of the blocks of the TTS and two vertices are joined by an edge if the corresponding blocks intersect in exactly two elements.…

An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…

We consider edge decompositions of the $n$-dimensional hypercube $Q_n$ into isomorphic copies of a given graph $H$. While a number of results are known about decomposing $Q_n$ into graphs from various classes, the simplest cases of paths…

It is known that the $n$-dimensional hypercube $Q_n,$ for $n$ even, has a decomposition into $k$-cycles for $k=n, 2n,$ $2^l$ with $2 \leq l \leq n.$ In this paper, we prove that $Q_n$ has a decomposition into $2^mn$-cycles for $n \geq 2^m.$…

The hypercube Qn of dimension n is one of the most versatile and powerful interconnection networks. The n-dimensional folded cube denoted as FQn, a variation of the hypercube possesses some embeddable properties that the hypercube does not…

In this paper, we consider the problem of decomposing the augmented cube $AQ_n$ into two spanning, regular, connected and pancyclic subgraphs. We prove that for $ n \geq 4$ and $ 2n - 1 = n_1 + n_2 $ with $ n_1, n_2 \geq 2,$ the augmented…

BCube, as a popular server-centric data center network (DCN), offers significant advantages in low latency, load balancing, and high bandwidth. The many-to-many paired $m$-disjoint path cover ($m$-DPC), a generalization of Hamiltonian…

A graph is said to be cyclic $k$-edge-connected, if at least $k$ edges must be removed to disconnect it into two components, each containing a cycle. Such a set of $k$ edges is called a cyclic-$k$-edge cutset and it is called a trivial…

Let $ex(Q_n, H)$ be the largest number of edges in a subgraph $G$ of a hypercube $Q_n$ such that there is no subgraph of $G$ isomorphic to $H$. We show that for any integer $k\geq 3$, $$ex(Q_n, C_{4k+2})= O(n^{\frac{5}{6} +…

We show that provided $\log^{50} n/n \leq p \leq 1 - n^{-1/4}\log^9 n$ we can with high probability find a collection of $\lfloor \delta(G)/2 \rfloor$ edge-disjoint Hamilton cycles in $G \sim G_{n, p}$, plus an additional edge-disjoint…

We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson…

We construct an explicit Hamiltonian cycle in the state graph of the 5-puzzle on a toroidal 2x 3 grid, a graph with 720 vertices. The cycle is described by a short symbolic sequence of 48 moves over the alphabet {L,R,V}, repeated $15$…

We study recursive-cube-of-rings (RCR), a class of scalable graphs that can potentially provide rich inter-connection network topology for the emerging distributed and parallel computing infrastructure. Through rigorous proof and validating…

The balanced hypercube $BH_n$, a variant of the hypercube, was proposed as a desired interconnection network topology. It is known that $BH_n$ is bipartite. Assume that $S=\{s_1,s_2,\cdots,s_{2n-2}\}$ and $T=\{t_1,t_2,\cdots,t_{2n-2}\}$ are…