Related papers: The Separated Box Product of Two Digraphs
In this paper we determine partial answers to the question given in the title, thereby significantly extending results of Broere and Hattingh. We characterize completely those pairs of complete graphs whose tensor products are circulant. We…
If $G$ is a graph then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$ where $d$ is the distance function. We say a graph $G$ is $distance\ preserving\ (dp)$ if it has an isometric…
The geometric product, defined by Graf on the space of differential forms, endows the sections of the exterior bundle by a structure that is necessary to construct a Clifford algebra. The Graf product is introduced and revisited with a…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
Many quantities of interest in communications, signal processing, artificial intelligence, and other areas can be expressed as the partition sum of some factor graph. Although the exact calculation of the partition sum is in many cases…
Here we generalize the concept of spatial tensor product, introduced by Skeide, of two product systems via a pair of normalized units. This new notion is called amalgamated tensor product of product systems, and now the amalgamation can be…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
We construct indecomposable and noncrossed product division algebras over function fields of smooth curves X over Z_p. This is done by defining an index preserving morphism s:Br(\hat K(X))' -> Br(K(X))' which splits res:Br(K(X)) -> Br(\hat…
The lexicographic product $G[H]$ of two graphs $G$ and $H$ is obtained from $G$ by replacing each vertex with a copy of $H$ and adding all edges between any pair of copies corresponding to adjacent vertices of $G$. We consider also the…
Some basic geometric properties of doubly twisted product immersions are established.
In this paper, we give a characterization for a class of edge-transitive Cayley graphs, and provide methods for constructing Cayley graphs with certain symmetry properties. Also this study leads to construct and characterise a new family of…
Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…
Divisible design digraphs are constructed from skew balanced generalized weighing matrices and generalized Hadamard matrices. Commutative and non-commutative association schemes are shown to be attached to the constructed divisible design…
We introduce a construction of highly arc transitive digraphs using a layerwise direct product. This product generalizes some known classes of highly arc transitive digraphs but also allows to construct new such. We use the product to…
This paper shows that $K_t$-minor-free (and $K_{s, t}$-minor-free) graphs $G$ are subgraphs of products of a tree-like graph $H$ (of bounded treewidth) and a complete graph $K_m$. Our results include optimal bounds on the treewidth of $H$…
A covariant Poisson bracket and an associated covariant star product in the sense of deformation quantization are defined on the algebra of tensor-valued differential forms on a symplectic manifold, as a generalization of similar structures…
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these…
We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied, and whose product is square. Cycles in this graph have a parity, that is, they are either even (termed e-cycles) or odd (termed o-cycles).…
We consider a free action of an Ore semigroup on a higher-rank graph, and the induced action by endomorphisms of the $C^*$-algebra of the graph. We show that the crossed product by this action is stably isomorphic to the $C^*$-algebra of a…
In this paper, we study the unit dot graph of product of commutative rings