no code implementations • 11 Mar 2021 • S. Morteza Mirafzal, Roya Kogani
We define the graph $S(q, n, k)$ as a graph with the vertex set $V=V_k \cup V_{k+1}$, where $V_k$ and $V_{k+1}$ are the family of subspaces in $V(q, n)$ of dimension $k$ and $k+1$ respectively, in which two vertices $v$ and $w$ are adjacent whenever $v$ is a subspace of $w$ or $w$ is a subspace of $v$.
Combinatorics 05C50, 05C25
no code implementations • 5 Jan 2021 • S. Morteza Mirafzal
In particular, we show that the graph ${Q^2_n}$ is distance-transitive.
Combinatorics Group Theory
no code implementations • 25 May 2019 • Jia-Bao Liu, S. Morteza Mirafzal, Ali Zafari
If all the eigenvalues of the adjacency matrix of the graph $\Gamma$ are integers, then we say that $\Gamma$ is an integral graph.
Combinatorics 05C50, 05C31
