Related papers: On Sum Graphs over Some Magmas

We study the automorphisms of a graph product of finitely-generated abelian groups W. More precisely, we study a natural subgroup Aut* W of Aut W, with Aut* W = Aut W whenever vertex groups are finite and in a number of other cases. We…

The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…

This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at least two vertices and is not a join and…

A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…

Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…

We complement the characterization of the graph products of cyclic groups $G(\Gamma, \mathfrak{p})$ admitting a Polish group topology of [9] with the following result. Let $G = G(\Gamma, \mathfrak{p})$, then the following are equivalent:…

Using the Polya Enumeration Theorem, we count with particular attention to C^3/Gamma up to C^6/Gamma, abelian orbifolds in various dimensions which are invariant under cycles of the permutation group S_D. This produces a collection of…

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…

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…

We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…

We study families of self-adjoint operators with given spectra whose sum is a scalar operator. Such families are $*$-representations of certain algebras which can be described in terms of graphs and positive functions on them. The main…

In this paper, we investigate the complexity of an infinite family of Cayley graphs $\mathcal{D}_{n}=Cay(\mathbb{D}_{n}, b^{\pm\beta_1},b^{\pm\beta_2},\ldots,b^{\pm\beta_s}, a b^{\gamma_1}, a b^{\gamma_2},\ldots, a b^{\gamma_t} )$ on the…

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…

For every $n \geq 1$, let $(\mathrm{FW}_n)$ denote the fixed-point property for median graphs of cubical dimension $n$ (or equivalently, for CAT(0) cube complexes of dimension $n$). In this article, we construct explicit examples of groups…

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

A constructive characterization of the class of uniformly $4$-connected graphs is presented. The characterization is based on the application of graph operations to appropriate vertex and edge sets in uniformly $4$-connected graphs, that…

Let $G$ be a graph. A total dominating set in a graph $G$ is a set $S$ of vertices of $G$ such that every vertex in $G$ is adjacent to a vertex in $S$. Recently, the following question was proposed: "Is it true that every connected cubic…

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…