相关论文: Cayley graphs for extraspecial p-groups and a cove…

A certain signed adjacency matrix of the hypercube, which Hao Huang used last year to resolve the sensitivity conjecture, is closely related to the unique, 4-cycle free, 2-fold cover of the hypercube. We develop a framework in which this…

Recently, Huang gave a very elegant proof of the Sensitivity Conjecture by proving that hypercube graphs have the following property: every induced subgraph on a set of more than half its vertices has maximum degree at least $\sqrt{d}$,…

A discrete analog of quantum unique ergodicity was proved for Cayley graphs of quasirandom groups by Magee, Thomas and Zhao. They show that for large graphs there exist real orthonormal basis of eigenfunctions of the adjacency matrix such…

Huang proved that every set of more than half the vertices of the $d$-dimensional hypercube $Q_d$ induces a subgraph of maximum degree at least $\sqrt{d}$, which is tight by a result of Chung, F\"uredi, Graham, and Seymour. Huang asked…

We introduce the notion of a symmetric basis of a vector space equipped with a quadratic form, and provide a sufficient and necessary condition for the existence to such a basis. Symmetric bases are then used to study Cayley graphs of…

A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. For a prime p, we call a bi-Cayley graph over a metacyclic p-group a bi-p-metacirculant.…

By using a $q$-analogue of the "magic" matrix introduced by H.Huang in his elegant solution of the sensitivity conjecture, we give a direct generalization of his result, replacing a hypercube graph by a Cartesian power of a directed…

The spined cube $SQ_n$ is a variant of the hypercube $Q_n$, introduced by Zhou et al. in [Information Processing Letters 111 (2011) 561-567] as an interconnection network for parallel computing. A graph $\G$ is an $m$-Cayley graph if its…

Let $S$ be a set of transpositions that generates the symmetric group $S_n$, where $n \ge 3$. The transposition graph $T(S)$ is defined to be the graph with vertex set $\{1,\ldots,n\}$ and with vertices $i$ and $j$ being adjacent in $T(S)$…

This paper focuses on the embeddability of hypercubes in an important class of Cayley graphs, known as augmented cubes. An $n$-dimensional augmented cube $AQ_n$ is constructed by augmenting the $n$-dimensional hypercube $Q_n$ with…

Let $G$ be a Cayley graph of the elementary abelian $2$-group $\mathbb{Z}_2^{n}$ with respect to a set $S$ of size $d$. We prove that for any such $G, S$ and $d$, the maximum degree of any induced subgraph of $G$ on any set of more than…

Let \(X\subset \mathbb{P}^{n+1}\) be a smooth cubic hypersurface, and let \(F(X)\) be the variety of lines on \(X\). We prove the surjectivity of the cylinder maps on the Chow groups of \(F(X)\) and \(X\) if \(X\) contains a one-cycle of…

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…

Suppose that $F$ is a finite field and $R=M_n(F)$ is the ring of $n$-square matrices over $F$. Here we characterize when the Cayley graph of the additive group of $R$ with respect to the set of invertible elements of $R$, called the unitary…

Following a problem posed by Lov\'asz in 1969, it is believed that every connected vertex-transitive graph has a Hamilton path. This is shown here to be true for cubic Cayley graphs arising from groups having a $(2,s,3)$-presentation, that…

A Cayley graph $\Ga=\Cay(G,S)$ is said to be normal if $G$ is normal in $\Aut\Ga$. The concept of normal Cayley graphs was first proposed by M.Y.Xu in [Discrete Math. 182, 309-319, 1998] and it plays an important role in determining the…

Bermond, Jackson and Jaeger [{\em J. Combin. Theory Ser. B} 35 (1983): 297-308] proved that every bridgeless ordinary graph $G$ has a circuit $4$-cover and Fan [{\em J. Combin. Theory Ser. B} 54 (1992): 113-122] showed that $G$ has a…

A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. A non-abelian group is called an inner-abelian group if all of its proper subgroups are…

In \cite{Chan95}, the authors classified the 2-extendable abelian Cayley graphs and posed the problem of characterizing all 2-extendable Cayley graphs. We first show that a connected bipartite Cayley (vertex-transitive) graph is…

A binary Cayley graph is a Cayley graph based on a binary group. In 1982, Payan proved that any non-bipartite binary Cayley graph must contain a generalized Mycielski graph of an odd-cycle, implying that such a graph cannot have chromatic…