Super edge‐ and point‐connectivities of the Cartesian product of regular graphs
Bih‐Sheue Shieh · Networks · 2002
Abstract 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.