Related papers: A note on circular wirelength for hypercubes
Though embedding problems have been considered for several regular graphs, it is still an open problem for hypercube into torus. In the paper, we prove the conjecture mathematically and obtain the minimum wirelength of embedding for…
Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding…
In this article the cyclic cutwidth of the $n$-dimensional cube is explored. It has been conjectured by Dr. Chavez and Dr. Trapp that the cyclic cutwidth of $Q_n$ is minimized with the Graycode numbering. Several results have been found…
Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential…
We study the problem of Embedding Wirelength of $n$-dimensional Hypercube $Q_n$ into Cylinder $C_{2^{n_1}}\times P_{2^{n_2}}$, where $n_1+ n_2=n$, called EWHC. We show that such wirelength corresponding to Gray code embedding is…
Graph embeddings play a significant role in the design and analysis of parallel algorithms. It is a mapping of the topological structure of a guest graph G into a host graph H, which is represented as a one-to-one mapping from the vertex…
Given an integer $1\leq j <n$, define the $(j)$-coloring of a $n$-dimensional hypercube $H_{n}$ to be the $2$-coloring of the edges of $H_{n}$ in which all edges in dimension $i$, $1\leq i \leq j$, have color $1$ and all other edges have…
The circumference denoted by $c(G)$ of a graph $G$ is the length of its longest cycle. Let $\delta(G)$ and $\omega(G)$ denote the minimum degree and the clique number of a graph $G$, respectively. In [\emph{Electron. J. Combin.} 31(4)(2024)…
In this paper, we study the following two hypercube coloring problems: Given $n$ and $d$, find the minimum number of colors, denoted as ${\chi}'_{d}(n)$ (resp. ${\chi}_{d}(n)$), needed to color the vertices of the $n$-cube such that any two…
Consider a variant of the graph diameter of a polyhedron where each step in a walk between two vertices travels maximally in a circuit direction instead of along incident edges. Here circuit directions are non-trivial solutions to…
A famous conjecture of Caccetta and H\"{a}ggkvist (CHC) states that a directed graph $D$ with $n$ vertices and minimum outdegree at least $r$ has a directed cycle of length at most $\lceil \frac{n}{r}\rceil$. In 2017, Aharoni proposed the…
Thomassen's chord conjecture from 1976 states that every longest cycle in a $3$-connected graph has a chord. This is one of the most important unsolved problems in graph theory. Let $H$ be a subgraph of a graph $G$. A vertex $v$ of $H$ is…
A long-standing conjecture of Thomassen says that every longest cycle of a $3$-connected graph has a chord. Thomassen (2018) proved that if $G$ is $2$-connected and cubic, then any longest cycle must have a chord. He also showed that if $G$…
We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…
A famous conjecture of Caccetta and H\"aggkvist is that in a digraph on $n$ vertices and minimum out-degree at least $\frac{n}{r}$ there is a directed cycle of length $r$ or less. We consider the following generalization: in an undirected…
In this paper, we study the Calabi-Yau conjectures for complete minimal hypersurfaces $\Sigma^{n}\subset \mathbb{R}^{n+1}$ in dimensions $n\ge 3$. These conjectures ask whether a complete minimal hypersurface must be unbounded, and more…
In 2008, Chen and Chv\'atal conjectured that in every finite metric space of $n$ points, there are at least $n$ distinct lines, or the whole set of points is a line. This is a generalization of a classical result in the Euclidean plane. The…
Let $S_d(n)$ denote the minimum number of wires of a depth-$d$ (unbounded fan-in) circuit encoding an error-correcting code $C:\{0, 1\}^n \to \{0, 1\}^{32n}$ with distance at least $4n$. G\'{a}l, Hansen, Kouck\'{y}, Pudl\'{a}k, and Viola…
A {sign-circuit cover} $\mathcal{F}$ of a signed graph $(G, \sigma)$ is a family of sign-circuits which covers all edges of $(G, \sigma)$. The shortest sign-circuit cover problem was initiated by M\'a$\check{\text{c}}$ajov\'a, Raspaud,…
The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the…