Related papers: Using Schur Rings to Produce GRRs for Dihedral Gro…

Considering regular graphs with every edge in a triangle we prove lower bounds for the number of triangles in such graphs. For r-regular graphs with r <= 5 we exhibit families of graphs with exactly that number of triangles and then…

Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…

We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups $G_2(4)$ and $G_2(5)$, the orthogonal group $O(7,3)$ and the Tits group $T=$$^2F_4(2)'$. Most of the constructed…

For the direct product $\cZ\times \cZ_3$ of infinite cyclic group $\cZ$ and a cyclic group $\cZ_3$ of order $3$, the schur rings over it are classified. In particular, all the schur rings are proved to be traditional.

The purpose of this paper is to extend the scope of the Ehrhart theory to periodic graphs. We give sufficient conditions for the growth sequences of periodic graphs to be a quasi-polynomial and to satisfy the reciprocity laws. Furthermore,…

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

A combinatorial criterion for the edge ring of a finite connected graph to satisfy Serre's condition R_1 is studied.

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…

A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory…

We give necessary and sufficient conditions for a few classes of known circulant graphs and/or digraphs to be singular. The above graph classes are generalized to $(r,s,t)$-digraphs for non-negative integers $r,s$ and $t$, and the digraph…

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every its algebraic isomorphism to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial isomorphism. We prove that…

We give simple arithmetic conditions that force the Sylow $p$-subgroup of the critical group of a strongly regular graph to take a specific form. These conditions depend only on the parameters $(v, k, \lambda, \mu)$ of the strongly regular…

Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct…

The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

Using Cayley graphs and Clifford algebras, we are able to give, for every finitely generated groups, a uniform construction of spectral triples with a generically non-trivial phase for the Dirac operator. Unfortunatly $D_{+}$ is index $0$,…

Which groups can occur as the group of units in a ring? Such groups are called realizable. Though the realizable members of several classes of groups have been determined (e.g., cyclic, odd order, alternating, symmetric, finite simple,…

The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…

The paper surveys highlights of the ongoing program to classify discrete polyhedral structures in Euclidean 3-space by distinguished transitivity properties of their symmetry groups, focussing in particular on various aspects of the…

Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…