Search arXivSearch

arXiv · 2308.03066

Algebraic degrees of quasi-abelian semi-Cayley digraphs

Abstract

For a digraph $Γ$, if $F$ is the smallest field that contains all roots of the characteristic polynomial of the adjacency matrix of $Γ$, then $F$ is called the splitting field of $Γ$. The extension degree of $F$ over the field of rational numbers $\mathbb{Q}$ is said to be the algebraic degree of $Γ$. A digraph is a semi-Cayley digraph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. A semi-Cayley digraph $\mathrm{SC}(G,T_{11},T_{22},T_{12},T_{21})$ is called quasi-abelian if each of $T_{11},T_{22},T_{12}$ and $T_{21}$ is a union of some conjugacy classes of $G$. This paper determines the splitting field and the algebraic degree of a quasi-abelian semi-Cayley digraph over any finite group in terms of irreducible characters of groups. This work generalizes the previous works on algebraic degrees of Cayley graphs over abelian groups and any group having a subgroup of index 2, and semi-Cayley digraphs over abelian groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shixin Wang, Majid Arezoomand, Tao Feng. 2023-08-06. Algebraic degrees of quasi-abelian semi-Cayley digraphs. https://arxiv.org/abs/2308.03066

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO