Related papers: A Normal Graph Algebra

We prove that if $A$ is a regular graded skew Clifford algebra and is a twist of a regular graded Clifford algebra $B$ by an automorphism, then the subalgebra of $A$ generated by a certain normalizing sequence of homogeneous degree-two…

These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The…

A few properties of unitary Cayley graphs are explored using their eigenvalues. It is shown that the adjacency algebra of a unitary Cayley graph is a coherent algebra. Finally, a class of unitary Cayley graphs that are distance regular are…

In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of colors assigned to the edge and the four edges adjacent it, has exactly five or exactly three distinct colors, respectively. An edge is normal in an edge-coloring…

We study the evolution of graphs densifying by adding edges: Two vertices are chosen randomly, and an edge is (i) established if each vertex belongs to a tree; (ii) established with probability $p$ if only one vertex belongs to a tree;…

One of the central questions of universal algebraic geometry is: when two algebras have the same algebraic geometry? There are various interpretations of the sentence "Two algebras have the same algebraic geometry". One of these is…

The phenomenom of emerging regular spectral features from random interactions is addressed in the context of the vibron model. A mean-field analysis links different regions of the parameter space with definite geometric shapes. The results…

Let $G$ be a graph with $n$ vertices, and let $A(G)$ and $D(G)$ denote respectively the adjacency matrix and the degree matrix of $G$. Define $$ A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G) $$ for any real $\alpha\in [0,1]$. The…

We define algebras of admissible functions associated to twisted Dirac structures, and we show that they are Poisson algebras. We study the standard cases associated to Dirac structures defined by graphs of non-degenerate 2-forms.

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…

Let $\Gamma$ be a graph and let $G$ be a group of automorphisms of $\Gamma$. The graph $\Gamma$ is called $G$-normal if $G$ is normal in the automorphism group of $\Gamma$. Let $T$ be a finite non-abelian simple group and let $G = T^l$ with…

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…

This is a brief review of our recent work attempted at a generalization of the Grassmann algebra to the paragrassmann ones. The main aim is constructing an algebraic basis for representing `fractional' symmetries appearing in $2D$…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.

The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. By appropriately introducing a weight to each edge of a graph, we determine, among other thing, the skewness of the generalized Petersen…

We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

Graph neural networks have developed by leaps and bounds in recent years due to the restriction of traditional convolutional filters on non-Euclidean structured data. Spectral graph theory mainly studies fundamental graph properties using…

We provide a complete classification of all algebras of generalised dihedral type, which are natural generalizations of algebras which occurred in the study of blocks with dihedral defect groups. This gives a description by quivers and…