Related papers: Commensurability of graph products
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. graphs forms a common generalization of the classes of…
Two recent publications describe realizable Gauss diagrams using conditions stating that the number of chords in certain sets of chords is even or odd. We demonstrate that these descriptions are incorrect by finding multiple…
We investigate when the independence complex of $G[H]$, the lexicographical product of two graphs $G$ and $H$, is either vertex decomposable or shellable. As an application, we construct an infinite family of graphs with the property that…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
In this paper, we provide few results on the group distance magic labeling of lexicographic product and direct product of two graphs. We also prove some necessary conditions for a graph to be group distance magic and provide a…
A signed graph product is defined for a new product, and initially the unsigned graph product's Laplacian spectrum and signless Laplacian spectrum are found. Next, for the signed graph product, the adjacency spectrum, Laplacian spectrum,…
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number. It is established that the two…
We define a semidirect product groupoid of a system of partially defined local homeomorphisms $T=(T_{1},..., T_{r})$. We prove that this construction gives rise to amenable groupoids. The associated algebra is a Cuntz-like algebra. We use…
The category of crossed complexes gives an algebraic model of the category of $CW$-complexes and cellular maps. We explain basic results on crossed complexes which allow the computation of free crossed resolutions of graph products of…
Suppose a group $G$ is quasi-isometric to a free product of a finite set $S$ of finitely generated abelian groups; let $S'$ denote the set of ranks of the free abelian parts of the groups in $S$. Then $G$ is commensurable with the free…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
To define a minimal mathematical framework for isolating some of the characteristic properties of quantum entanglement, we introduce a generalization of the tensor product of graphs. Inspired by the notion of a density matrix, the…
We define a general product of two $n$-dimensional tensors $\mathbb {A}$ and $\mathbb {B}$ with orders $m\ge 2$ and $k\ge 1$, respectively. This product is a generalization of the usual matrix product, and satisfies the associative law.…
The domination polynomials of binary graph operations, aside from union, join and corona, have not been widely studied. We compute and prove recurrence formulae and properties of the domination polynomials of families of graphs obtained by…