tensor product of graphssymmetric digraphIn this paper, it is shown that the necessary and sufficient condition for the existence of an S⃗(m−1)k+1-factorization of (Km × Kn)∗ is n = ((m − 1)k + 1)t, for some integer t ≥ 1, for the given integers m,n ≥ 2 and...
weak direct product, orconjunction 注意上面的第二个名称:Kronecker product ,这家伙不是一种矩阵运算吗?恭喜你,图的张量积研究就是等价与这些图邻接矩阵做 Kronecker product。(It is also equivalent to the Kronecker product of the adjacency matrices of the graphs) 矩阵的Kronecker product 定义如下: If A...
In this paper, we determine the degree distance of G x Kr0,r1,...,rn-1 and G Kr0,r1,...,rn-1 , where x and denote the tensor product and strong product of graphs, respectively, and Kr0, r1, ..., rn-1 denotes the complete multipartite graph with partite sets V0, V1, . ...
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 generalization is a simple one: every graph can be obtained by addit...
3) lexicographic product of graphs 图的张量积 1. The products of graphs discussed in this paper are the following four kinds: the Cartesian product of graphs, the tensor product of graphs, the lexicographic product of graphs and the strong direct product of graphs. 本文所讨论的积图是图的...
1) outer product of tensors 张量的外积 2) Extra tensor product 外张量积 3) lexicographic product of graphs 图的张量积 1. The products of graphs discussed in this paper are the following four kinds: the Cartesian product of graphs, the tensor product of graphs, the lexicographic product ...
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs... Tsai,Westin,Willsky - IEEE Conference on Computer Vision & Pattern Recognition 被引...
In this paper, the existence of directed Hamilton cycle decompositions of symmetric digraphs of tensor products of regular graphs, namely, (Kr ×Ks)*, ((Kr °[`(K)]s) ×Kn)*, ((Kr ×Ks) ×Km)*, ((Kr °[`(K)]s) ×(Km °[`(K)]n))*(K_r times K_s)^*,,,((K...
18.The contraction may be applied to products of components, which have tensor character.缩并可以用于具有张量性质的分量之积。 相关短句/例句 tensor products张量积 1.We have determined the edge-bindingmumber of tensor products of the following graphs:path and circuit,circuit and circuit,pathand comple...