Related papers: Commensurability of graph products
We undertake a comprehensive study of structural properties of graph products of von Neumann algebras equipped with faithful, normal states, as well as properties of the graph products relative to subalgebras coming from induced subgraphs.…
Inspired by the definition of generalized wreath product of permutation groups, we define the generalized wreath product of graphs, containing the classical Cartesian and wreath product of graphs as particular cases. We prove that the…
A notion of \emph{graph-wreath product} is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type $\operatorname{F}_n$. Under various additional assumptions we show…
We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free…
We determine all the ways in which a direct product of two finite groups can be expressed as the set-theoretical union of proper subgroups in a family of minimal cardinality.
The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s. This survey presents these families and their applications related to graphs, digraphs, and hypergraphs.…
Graph Neural Networks have revolutionized many machine learning tasks in recent years, ranging from drug discovery, recommendation systems, image classification, social network analysis to natural language understanding. This paper shows…
The parameter $q(G)$ of a graph $G$ is the minimum number of distinct eigenvalues of a symmetric matrix whose pattern is given by $G$. We introduce a novel graph product by which we construct new infinite families of graphs that achieve…
This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…
Let $d \geq 1$ be an integer. From a set of $d$-dimensional vectors, we obtain a $d$-\dpg\ by letting each vector $\va^u$ correspond to a vertex $u$ and by adding an edge between two vertices $u$ and $v$ if and only if their dot product…
This paper proposes a family of graph metrics for measuring distances between graphs of different sizes. The proposed metric family defines a general form of the graph generalised optimal sub-pattern assignment (GOSPA) metric and is also…
An automorphism of a graph describes its structural symmetry and the concept of fixing number of a graph is used for breaking its symmetries (except the trivial one). In this paper, we evaluate automorphisms of the co-normal product graph…
We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
If $G$ is a solvable group, we take $\Delta (G)$ to be the character degree graph for $G$ with primes as vertices. We prove that if $\Delta (G)$ is a square, then $G$ must be a direct product.
A classification is given of all the countable homogeneous ordered bipartite graphs.
In the study of random structures we often face a trade-off between realism and tractability, the latter typically enabled by assuming some form of independence. In this work we initiate an effort to bridge this gap by developing tools that…
Given two graphs, a backbone and a finger, a comb product is a new graph obtained by grafting a copy of the finger into each vertex of the backbone. We study the comb graphs in the case when both components are the paths of order $n$ and…
We show that any graph product of residually finite monoids is residually finite. As a special case we obtain that any free product of residually finite monoids is residually finite. The corresponding results for graph products of…