摘要
本文讨论了两个可分图的张量乘积图的同构因子分解问题.给出了张量乘积图可同构因子分解的判定条件.
In this paper, we discuss isomorphic factorization for tensor product of two divisible graphs and prove the conditions for the tensor product graphs to be factorized isomorphically.
出处
《系统科学与数学》
CSCD
北大核心
1997年第4期303-306,共4页
Journal of Systems Science and Mathematical Sciences
关键词
可分图
同构因子分解
邻接矩阵
张量乘积图
Tensor product, divisible graph, isomorphic factorization, adjacency matrix
