On connectivity of the Cartesian product of two graphs
作者:
Highlights:
•
摘要
In this paper, sufficient conditions for the Cartesian product of two graphs to be maximum edge-connected, maximum point-connected, super edge-connected or super point-connected are presented. As a corollary, some graphs with these properties are obtained. Furthermore, the relationship between super point-connectivity and super edge-connectivity on the Cartesian product of graphs is pointed out.
论文关键词:Cartesian product,Maximum connectivity,Super connectivity
论文评审过程:Available online 7 July 1999.
论文官网地址:https://doi.org/10.1016/S0096-3003(98)10041-3