In this article, we study the restricted edge connectivity of Cartesian product and direct product of regular graphs.
本文研究正则图的笛卡尔乘积图与直接乘积图的限制边连通性。
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.
本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理,并给出了若干多重乘积图的联结数的极限性质。
应用推荐