Related papers: Graph products of right cancellative monoids
We build on the description of left congruences on an inverse semigroup in terms of the kernel and trace due to Petrich and Rankin. The notion of an inverse kernel for a left congruence is developed. Various properties of both the trace and…
A graph is reducible if it is the lexicographic product of two smaller non-trivial graphs. It is well-known a 1-planar graph with $n ~(\ge3)$ vertices has at most $4n-8$ edges, and a graph $G$ with $n$ vertices is optimal if $G$ has exactly…
This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…
Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…
We prove rigidity properties for von Neumann algebraic graph products. We introduce the notion of rigid graphs and define a class of II$_1$-factors named $\mathcal{C}_{\rm Rigid}$. For von Neumann algebras in this class we show a unique…
We prove three results about the graph product $G=\G(\Gamma;G_v, v \in V(\Gamma))$ of groups $G_v$ over a graph $\Gamma$. The first result generalises a result of Servatius, Droms and Servatius, proved by them for right-angled Artin groups;…
In this paper, we compare Ollivier Ricci curvature and Bakry-\'Emery curvature notions on combinatorial graphs and discuss connections to various types of Ricci flatness. We show that non-negativity of Ollivier Ricci curvature implies…
We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…
As part of his study of representations of the polycylic monoids, M.V. Lawson described all the closed inverse submonoids of a polycyclic monoid $P_n$ and classified them up to conjugacy. We show that Lawson's description can be extended to…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act is finitely presented. The corresponding notion for a ring $R$ states that every finitely generated submodule of every finitely…
A completely inverse $AG^{**}$-groupoid is a groupoid satisfying the identities $(xy)z=(zy)x$, $x(yz)=y(xz)$ and $xx^{-1}=x^{-1}x$, where $x^{-1}$ is a unique inverse of $x$, that is, $x=(xx^{-1})x$ and $x^{-1}=(x^{-1}x)x^{-1}$. First we…
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…
We prove necessary and sufficient conditions for when graph wreath products are residually finite, generalising known results for the permutational wreath product and free product cases.
We investigate the computational complexity of the graph primality testing problem with respect to the direct product (also known as Kronecker, cardinal or tensor product). In [1] Imrich proves that both primality testing and a unique prime…
An \emph{antimagic labeling} of a finite undirected simple graph with $m$ edges and $n$ vertices is a bijection from the set of edges to the integers $1,...,m$ such that all $n$ vertex sums are pairwise distinct, where a vertex sum is the…
Consider the following generalization of the bicyclic monoid. Let $\kappa$ be any infinite cardinal and let $\mathcal{IP\!F}\left(\sigma{\mathbb{N}^\kappa}\right)$ be the semigroup of all order isomorphisms between principal filters of the…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…