Related papers: Adjacency Algebra of Unitary Cayley Graph
This paper is a short survey about some properties of algebras ob- tained by the Cayley-Dickson process and some of their applications.
We conservatively extend classical elementary differential calculus to the Cartesian closed category of convergence spaces. By specializing results about the convergence space representation of directed graphs, we use Cayley graphs to…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
If all the eigenvalues of the Hermitian-adjacency matrix of a mixed graph are integers, then the mixed graph is called \emph{H-integral}. If all the eigenvalues of the (0,1)-adjacency matrix of a mixed graph are \emph{Gaussian integers},…
We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.
A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…
We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…
We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
The objective of this series is to study metric geometric properties of (coarse) disjoint unions of amenable Cayley graphs. We employ the Cayley topology and observe connections between large scale structure of metric spaces and group…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
A discrete analog of quantum unique ergodicity was proved for Cayley graphs of quasirandom groups by Magee, Thomas and Zhao. They show that for large graphs there exist real orthonormal basis of eigenfunctions of the adjacency matrix such…
It is shown that there are groups $\Gamma$ with finite generating sets $S$ such that the adjacency operator of the Cayley graph ${\rm Cay}(\Gamma,S)$ is a disjoint union of $N$ intervals, for arbitrarily large integers $N$.
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley…
There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…
In this article we investigate normalized adjacency eigenvalues (simply normalized eigenvalues) and normalized adjacency energy of connected threshold graphs. A threshold graph can always be represented as a unique binary string. Certain…
In this paper we show that, for a class of countable graphs, every representation of the associated graph algebra in a separable Hilbert space is unitarily equivalent to a representation obtained via branching systems.
In this paper we introduce a Cayley-type graph for group-subgroup pairs and present some elementary properties of such graphs, including connectedness, their degree and partition structure, and vertex-transitivity. We relate these…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
Finding identities in nonassociative algebras plays an important role in the study of properties of these algebras. In this paper, we present some identities in alternative algebras and in algebras obtained by the Cayley-Dickson process.…