Super edge‐ and point‐connectivities of the Cartesian product of regular graphs
Super edge‐ and point‐connectivities of the Cartesian product of regular graphs
复制标题
DOI：
10.1002/net.10037
复制
发表时间：
2002-09
期刊：
影响因子：
2.1
通讯作者：
B. Shieh
中科院分区：
文献类型：
--
作者：
B. Shieh
We prove that the Cartesian product of two regular graphs with maximum edge (respectively, point‐)‐connectivity is super edge (respectively, point‐)‐connected except for the case K2 × Kn, n ≥ 2 (respectively, n ≥ 4), where Kn is a complete graph of order n. Using these results, certain classes of networks which are recursively defined by the Cartesian product can be simply shown to possess super edge‐connectivity and super point‐connectivity. © 2002 Wiley Periodicals, Inc.
