Related papers: Graph products of right cancellative monoids

Sturmfels-Sullivant conjectured that the cut polytope of a graph is normal if and only if the graph has no K_5 minor. In the present paper, it is proved that the normality of cut polytopes of graphs is a minor closed property. By using this…

In this paper we investigate locally compact semitopological graph inverse semigroups. Our main result is the following: if a directed graph $E$ is strongly connected and contains a finite amount of vertices then a locally compact…

A fixing set $\mathcal{F}$ of a graph $G$ is a set of those vertices of the graph $G$ which when assigned distinct labels removes all the automorphisms from the graph except the trivial one. The fixing number of a graph $G$, denoted by…

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

We consider the ideal structure of reduced crossed products over discrete groups. First, we completely characterize primality for reduced crossed products. Second, we characterize the ideal intersection property for reduced crossed products…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…

We give a construction of the projective indecomposable modules and a description of the quiver for a large class of monoid algebras including the algebra of any finite monoid whose principal right ideals have at most one idempotent…

In this paper, we study the dot-product graphs in $\mathbb{F}_q^d$. We prove that if the size of the product of two adjacent sets is large enough, then the set of dot-product graphs has positive density. Our method is based on finite field…

Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…

Let X* be a subset of an affine space A^s, over a finite field K, which is parameterized by the edges of a clutter. Let X and Y be the images of X* under the maps x --> [x] and x --> [(x,1)] respectively, where [x] and [(x,1)] are points in…

The automorphism group of the composition of graphs $G \circ H$ contains the wreath product $Aut(H) \wr Aut(G)$ of the automorphism groups of the corresponding graphs. The classical problem considered by Sabidussi and Hemminger was under…

Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…

If $f : \tilde{\Gamma} \rightarrow \Gamma$ is a covering map between connected graphs, and $H$ is the subgroup of $\pi_1(\Gamma,v)$ used to construct the cover, then it is well known that the group of deck transformations of the cover is…

We study the algebraic invariants namely depth, Stanley depth, regularity and projective dimension of the residue class rings of the edge ideals associated with the corona product of various classes of graphs with any graph. We also give an…

The vertex-edge incidence matrix of a (connected) unicyclic graph G is a square matrix which is invertible if and only if the cycle of G is an odd cycle. A combinatorial formula of the inverse of the incidence matrix of an odd unicyclic…

The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut polytopes of $K_{3,3}$-minor-free graphs and introduce an…

We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…

Brawley and Carlitz introduced diamond products of elements of finite fields and associated composed products of polynomials in 1987. Composed products yield a method to construct irreducible polynomials of large composite degrees from…

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…