weak direct product graphs 弱直积图
direct product graphs 直接乘积图
Lexicographic product graphs 字典乘积图
Cartesian product of graphs 图的直积 ; 图的笛卡尔积
the Cartesian product of graphs 笛卡尔积图 ; 图的笛卡尔积
graphs product 图形产品
The cover pebbling number for lexicographic product graphs and some strong product graphs were determined.
对一个图而言，满足此条件的最小的自然数即为此图的覆盖数。
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.
本文讨论了两个可分图的张量乘积图的同构因子分解问题。
In this paper, a theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。
应用推荐