Zobrazeno 1 - 10
of 16 146
pro vyhledávání: '"Cayley graphs"'
In this article, we give characterization for existence of quantum fractional revival in unitary Cayley graph utilizing adjacency matrix Hamiltonian. Unitary Cayley graph $X=( Z_n, S)$ is a special graph as connection set $S \subseteq Z_n$ is the col
Externí odkaz:
http://arxiv.org/abs/2410.03310
Autor:
Priya, Kadyan, Monu
Let $Z$ be an abelian group, $ x \in Z$, and $[x] = \{ y : \langle x \rangle = \langle y \rangle \}$. A graph is called integral if all its eigenvalues are integers. It is known that a Cayley graph is integral if and only if its connection set can be
Externí odkaz:
http://arxiv.org/abs/2411.06386
Autor:
Nguyen, Tung T., Tân, Nguyen Duy
A graph is called integral if its eigenvalues are integers. In this article, we provide the necessary and sufficient conditions for a Cayley graph over a finite symmetric algebra $R$ to be integral. This generalizes the work of So who studies the cas
Externí odkaz:
http://arxiv.org/abs/2411.00307
Autor:
Ebrahimi, Mahdi
Let $\Gamma$ be a simple graph with $n$ vertices. The energy of $\Gamma$, denoted by $\mathcal{E}(\Gamma)$, is defined as the sum of the absolute values of the eigenvalues of $\Gamma$. The graph $\Gamma$ is said to be hyperenergetic if $\mathcal{E}(\
Externí odkaz:
http://arxiv.org/abs/2410.11306
Autor:
Krebs, Mike, Sankar, Maya
Let $G$ be an abelian group. The main theorem of this paper asserts that there exists a Cayley graph on $G$ with chromatic number 3 if and only if $G$ is not of exponent 1, 2, or 4. Although motivated by ideas from algebraic topology, our proof may b
Externí odkaz:
http://arxiv.org/abs/2410.11028
Autor:
Movahedi, Fateme1 f.movahedi@gu.ac.ir
Publikováno v:
Communications in Combinatorics & Optimization. 2024, Vol. 9 Issue 1, p119-130. 12p.
