English
Related papers

Related papers: Rationality conditions for the eigenvalues of norm…

200 papers

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

Combinatorics · Mathematics 2024-09-04 Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Group Theory · Mathematics 2021-05-27 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

Algebraic Geometry · Mathematics 2013-10-22 Abdallah Assi

In recent work, we study certain Cayley graphs associated with a finite commutative ring and their multiplicative subgroups. Among various results that we prove, we provide the necessary and sufficient conditions for such a Cayley graph to…

Combinatorics · Mathematics 2024-03-12 Tung T. Nguyen , Nguyen Duy Tân

A subset $C$ of the vertex set of a graph $\Gamma$ is said to be $(\alpha,\beta)$-regular if $C$ induces an $\alpha$-regular subgraph and every vertex outside $C$ is adjacent to exactly $\beta$ vertices in $C$. In particular, if $C$ is an…

Combinatorics · Mathematics 2024-06-06 F. Seiedali , B. Khosravi , Z. Akhlaghi

A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called normal if the right regular representation of $G$ is a normal subgroup in the full automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if…

Combinatorics · Mathematics 2021-05-18 Jin-Hua Xie , Yan-Quan Feng , Grigory Ryabov , Ying-Long Liu

Researchers in the past have studied eigenvalues of Cayley digraphs or graphs. We are interested in characterizing Cayley digraphs on a finite Abelian group G whose eigenvalues are algebraic integers in a given number field K. And we…

Combinatorics · Mathematics 2020-09-22 Fei Li

A connected linear algebraic group G is called a Cayley group if the Lie algebra of G endowed with the adjoint G-action and the group variety of G endowed with the conjugation G-action are birationally G-isomorphic. In particular, the…

Algebraic Geometry · Mathematics 2009-07-06 Nicole Lemire , Vladimir L. Popov , Zinovy Reichstein

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

Group Theory · Mathematics 2023-05-02 E. V. Sokolov

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

Combinatorics · Mathematics 2021-02-23 Junyang Zhang , Sanming Zhou

Given a finite group $G$ and a subset $S\subseteq G,$ the bi-Cayley graph $\bcay(G,S)$ is the graph whose vertex set is $G \times \{0,1\}$ and edge set is $\{\{(x,0),(s x,1)\} : x \in G, s\in S \}$. A bi-Cayley graph $\bcay(G,S)$ is called…

Group Theory · Mathematics 2013-09-02 Hiroki Koike , István Kovács

For a graph $\Gamma$, the multiplicity of the eigenvalue $0$, denoted by $\eta(\Gamma)$, is called the nullity of $\Gamma$. Also the energy of $\Gamma$, denoted by $\mathcal{E}(\Gamma)$, is defined as the sum of the absolute values of the…

Combinatorics · Mathematics 2024-10-24 Mahdi Ebrahimi

We introduce a family of graphs that generalises the class of Cayley graphs. For non-empty subsets L, R of a group G, the two-sided Cayley graph 2SC(G;L,R) is the directed graph with vertex set G and an arc from x to y if and only if…

Combinatorics · Mathematics 2014-01-14 Moharram N. Iradmusa , Cheryl E. Praeger

For a finite group $G$ with a normal subgroup $H$, the normal subgroup based power graph of $G$, denoted by $\Gamma_H(G)$ whose vertex set $V(\Gamma_H(G))=(G\setminus H)\bigcup \{e\}$ and two vertices $a$ and $b$ are edge connected if…

Combinatorics · Mathematics 2016-01-19 A. K. Bhuniya , Sudip Bera

In this paper, we give a necessary and sufficient condition for the integrality of Cayley graphs over the dihedral group $D_n=\langle a,b\mid a^n=b^2=1,bab=a^{-1}\rangle$. Moreover, we also obtain some simple sufficient conditions for the…

Combinatorics · Mathematics 2016-06-08 Lu Lu , Qiongxiang Huang , Xueyi Huang

Let $G$ denote a finite abelian group with identity 1 and let $S$ denote an inverse-closed subset of $G \setminus {1}$, which generates $G$ and for which there exists $s \in S$, such that $\la S \setminus \{s,s^{-1}\} \ra \ne G$. In this…

Combinatorics · Mathematics 2012-06-01 Stefko Miklavic , Primoz Sparl

A finite group $G$ is called a DCI-group if two Cayley digraphs over $G$ are isomorphic if and only if their connection sets are conjugate by a group automorphism. We prove that the group $C_2^5\times C_p$, where $p$ is a prime, is a…

Combinatorics · Mathematics 2020-12-29 Grigory Ryabov

Let $G$ be a finite group, and $S$ be a subset of $G\setminus\{1\}$ such that $S=S^{-1}$. Suppose that $Cay(G,S)$ is the Cayley graph on $G$ with respect to the set $S$ which is the graph whose vertex set is $G$ and two vertices $a,b\in G$…

Combinatorics · Mathematics 2015-05-05 Alireza Abdollahi , Shahrooz Janbaz , Mojtaba Jazaeri

Let $\Gamma=(V,E)$ be a graph. If all the eigenvalues of the adjacency matrix of the graph $\Gamma$ are integers, then we say that $\Gamma$ is an integral graph. A graph $\Gamma$ is determined by its spectrum if every graph cospectral to it…

Combinatorics · Mathematics 2021-01-22 Jia-Bao Liu , S. Morteza Mirafzal , Ali Zafari

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

Combinatorics · Mathematics 2008-08-12 Benjamin Steinberg