Related papers: The Cartesian product of graphs with loops

Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs \emph{without cycles} and moderate message update complexities, the sum-product algorithm (SPA) can be used to…

We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…

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…

While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…

We prove that the Seidel morphism of $(M \times M', \omega \oplus \omega')$ is naturally related to the Seidel morphisms of $(M,\omega)$ and $(M',\omega')$, when these manifolds are monotone. We deduce that any homotopy class of loops of…

Given an undirected graph $G$, the problem of deciding whether $G$ admits a simple and proper time-labeling that makes it temporally connected is known to be NP-hard (G\"obel et al., 1991). In this article, we relax this problem and ask…

In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

Anantharaman and Le Masson proved that any family of eigenbases of the adjacency operators of a family of graphs is quantum ergodic (a form of delocalization) assuming the graphs satisfy conditions of expansion and high girth. In this…

The Kronecker product is an invaluable tool for data-sparse representations of large networks and matrices with countless applications in machine learning, graph theory and numerical linear algebra. In some instances, the sparsity pattern…

Goresky, Kottwitz and MacPherson have recently shown that the computation of the equivariant cohomology ring of a G-manifold can be reduced to a computation in graph theory. This opens up the possibility that many of the fundamental…

Let $\mathscr C$ be a class of finite and infinite graphs that is closed under induced subgraphs. The well-known {\L}o\'s-Tarski Theorem from classical model theory implies that $\mathscr C$ is definable in first-order logic (FO) by a…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

Let $\mathbb{F}_q$ be a finite field of odd characteristic and $2\nu+\delta\geq2$ an integer number with $\delta=0,1$ or $2$. The orthogonal inner product graph $Oi\big(2\nu+\delta,q\big)$ over $\mathbb{F}_q$ is defined and the automorphism…

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…

In quantum information theory there is a construction for quantum channels, appropriately called a quantum graph, that generalizes the confusability graph construction for classical channels in classical information theory. In this paper,…

A diagram is introduced for visualizing matrix product states which makes transparent a connection between matrix product factorizations of states and operators, and complex weighted finite state automata. It is then shown how one can…

Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.

In this note, we consider the problem of generating $k$-factorable graphic sequences with connected (resp. no connected) $k$-factors.

We provide a general framework on the coefficients of the graph polynomials of graphs which are Cartesian products. As a corollary, we prove that if $G=(V,E)$ is a graph with degrees of vertices $2d(v), v\in V$, and the graph polynomial…