相关论文: On conjugacy of diagonalizable integral matrices

Given a finite group $G$ with a normal subgroup $N$, the simple graph $\Gamma_\textit{G}( \textit{N} )$ is a graph whose vertices are of the form $|x^G|$, where $x\in{N\setminus{Z(G)}}$, and $x^G$ is the $G$-conjugacy class of $N$…

We study covering graphs of the Paley graph associated to a finite field of characteristic p in the case where the covering transformation group is cyclic of prime order distinct from p. When the field has q = p elements, we show that the…

Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

Recently we showed that Hessenberg matrices are proper to represent conjugacy classes in SL(n,Z). In this paper we focus on the reducibility properties in the set of Hessenberg matrices of SL(3,Z). We investigate the first interesting open…

Consider two symmetric $3 \times 3$ matrices $A$ and $B$ with entries in $GF(q)$, for $q=p^n$, $p$ an odd prime. The zero sets of $v^T Av$ and $v^T Bv$ can be viewed as (possibly degenerate) conics in the finite projective coordinate plane…

We prove that if the prime graphs in a graph class have bounded lettericity, then the entire class has bounded lettericity if and only if it does not contain arbitrary large matchings, co-matchings, or a family of graphs that we call…

Let n be either 2, or an odd integer greater than 1, and fix a prime p > 2(n + 1). Under standard "adequate image" assumptions, we show that the set of components of n-dimensional p-adic potentially semistable local Galois deformation rings…

For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph…

We study variants of the well-known Collatz graph, by considering the action of the 3n+1 function on congruence classes. For moduli equal to powers of 2, these graphs are shown to be isomorphic to binary De Bruijn graphs. Unlike the Collatz…

It is conjectured that the Laplacian spectrum of a graph is majorized by its conjugate degree sequence. In this paper, we prove that this majorization holds for a class of graphs including trees. We also show that a generalization of this…

A generalised Paley map is a Cayley map for the additive group of a finite field F, with a subgroup S=-S of the multiplicative group as generating set, cyclically ordered by powers of a generator of S. We characterise these as the…

Let $\Gamma$ be a simple finite graph with vertex set $V(\Gamma)$ and edge set $E(\Gamma)$. Let $\mathcal{R}$ be an equivalence relation on $V(\Gamma)$. The $\mathcal{R}$-super $\Gamma$ graph $\Gamma^{\mathcal{R}}$ is a simple graph with…

A graph is called an integral graph when all eigenvalues of its adjacency matrix are integers. We study which Cayley graphs over a nonabelian group $$ T_{8n}=\left\langle a,b\mid a^{2n}=b^8=e,a^n=b^4,b^{-1}ab=a^{-1} \right \rangle $$ are…

Two distinct projections of finite rank $m$ are adjacent if their difference is an operator of rank two or, equivalently, the intersection of their images is $(m-1)$-dimensional. We extend this adjacency relation on other conjugacy classes…

Fix positive integers $p,q,$ and $r$ so that $p$ is prime, $q=p^r$, and $q\equiv 1$ (mod $4$). Fix a graph $G$ as follows: If $r$ is odd or $p\not\equiv 3$ (mod $4$), let $G$ be the $q$-vertex Paley graph; if $r$ is even and $p\equiv 3$…

Given a finite group G, we say that a subset C of G is power-closed if, for every x in C and y in <x> with <x>=<y>, we have that y lies in C. In this paper we are interested in finite Cayley digraphs Cay(G,C) over G with connection set C,…

A matching M is a dominating induced matching of a graph, if every edge of the graph is either in $M$ or has a common end-vertex with exactly one edge in $M$. The concept of complete dominating induced matching is introduced as graphs where…

We consider generalized Paley graphs $\Gamma(k,q)$, generalized Paley sum graphs $\Gamma^+(k,q)$, and their corresponding complements $\bar \Gamma(k,q)$ and $\bar \Gamma^+(k,q)$, for $k=3,4$. Denote by $\Gamma = \Gamma^*(k,q)$ either…