Qiongxiang Huang

activity

20162018

collaborators

5 papers

math.CO2018

Infinite classes of strongly regular graphs derived from $G L (n, F_{2})$

Lu Lu, Qiongxiang Huang, Jiangxia Hou

It is known that the automorphism group of the elementary abelian $2$ -group $Z_{2}^{n}$ is isomorphic to the general linear group $G L (n, F_{2})$ of degree $n$ over $F_{2}$ . Let $W$ be the c…

math.CO2018

The spectrum and automorphism group of the set-inclusion graph

Xueyi Huang, Qiongxiang Huang, Jianfeng Wang

Let $n$ , $k$ and $l$ be integers with $1 \leq k < l \leq n - 1$ . The set-inclusion graph $G (n, k, l)$ is the graph whose vertex set consists of all $k$ - and $l$ -subsets of $[n]=\{1,2,\ldot…

math.CO2018

The second eigenvalue of some normal Cayley graphs of high transitive groups

Xueyi Huang, Qiongxiang Huang, Sebastian M. Cioabă

Let $Γ$ be a finite group acting transitively on $[n] = {1, 2, \dots, n}$ , and let $G = Cay (Γ, T)$ be a Cayley graph of $Γ$ . The graph $G$ is called normal if $T$ is closed und…

math.CO2017

Graphs with at most three distance eigenvalues different from $- 1$ and $- 2$

Xueyi Huang, Qiongxiang Huang, Lu Lu

Let $G$ be a connected graph on $n$ vertices, and let $D (G)$ be the distance matrix of $G$ . Let $\partial_{1} (G) \geq \partial_{2} (G) \geq \dots \geq \partial_{n} (G)$ denote the eigenvalues of $…

math.CO2016

Integral Cayley Graphs over Dihedral Groups

Lu Lu, Qiongxiang Huang, Xueyi Huang

In this paper, we give a necessary and sufficient condition for the integrality of Cayley graphs over the dihedral group $D_{n} = ⟨ a, b ∣ a^{n} = b^{2} = 1, bab = a^{- 1} ⟩$ . Moreover…

Infinite classes of strongly regular graphs derived from GL(n,F2​)

The spectrum and automorphism group of the set-inclusion graph

The second eigenvalue of some normal Cayley graphs of high transitive groups

Graphs with at most three distance eigenvalues different from −1 and −2

Integral Cayley Graphs over Dihedral Groups

Infinite classes of strongly regular graphs derived from $G L (n, F_{2})$

Graphs with at most three distance eigenvalues different from $- 1$ and $- 2$