Related papers: The Separated Box Product of Two Digraphs
This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence…
This note explores the relation between the boxicity of undirected graphs and the Ferrers dimension of digraphs.
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.…
We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.
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,…
We define the twisted tensor product of two enriched categories, which generalizes various sorts of `products' of algebraic structures, including the bicrossed product of groups, the twisted tensor product of (co)algebras and the double…
The $\otimes_h$-product that refers the title was introduced in 2008 as a generalization of the Kronecker product of digraphs. Many relations among labelings have been obtained since then, always using as a second factor a family of super…
The concept of a crossed tensor product of algebras is studied from a few points of views. Some related constructions are considered. Crossed enveloping algebras and their representations are discussed. Applications to the noncommutative…
We introduce a definition of braided tensor product $\operatorname{M}\overline{\boxtimes}\operatorname{N}$ of von Neumann algebras equipped with an action of a quasi-triangular quantum group $\mathbb{G}$ (this includes the case when…
We propose a new operator defined between two tensors, the broadcast product. The broadcast product calculates the Hadamard product after duplicating elements to align the shapes of the two tensors. Complex tensor operations in libraries…
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with bounded thinness,…
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…
A continuous family of non-outer conjugate aperiodic automorphisms whose crossed-products are all isomorphic is given on every interpolated free group factor. An explicit "duality" relationship between compact co-commutative Kac algebra…
We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$. We also prove a lemma that is helpful to determine the…
The C*-algebra of a skew-product topological graph is a crossed product of the C*-algebra of the base topological graph by a coaction.
The three standard products (the Cartesian, the direct and the strong product) of undirected graphs have been wellinvestigated, unique prime factor decomposition (PFD) are known and polynomial time algorithms have been established for…
There are many different crossed products by an endomorphism of a C*-algebra, and constructions by Exel and Stacey have proved particularly useful. Here we show that every Exel crossed product is isomorphic to a Stacey crossed product,…
Let T be a complete discrete valuation ring and $\hat{X}$ a smooth projective curve over $S=\spec(T)$ with closed fibre $X$. Denote by $F$ the function field of $\hat{X}$ and by $\hat{F}$ the completion of $F$ with respect to the discrete…
In this paper we study a new product of graphs called {\em tight product}. A graph $H$ is said to be a tight product of two (undirected multi) graphs $G_1$ and $G_2$, if $V(H)=V(G_1)\times V(G_2)$ and both projection maps $V(H)\to V(G_1)$…
We introduce a new matrix product, that we call the wreath product of matrices. The name is inspired by the analogous product for graphs, and the following important correspondence is proven: the wreath product of the adjacency matrices of…