Premium
Super edge‐ and point‐connectivities of the Cartesian product of regular graphs
Author(s) -
Shieh BihSheue
Publication year - 2002
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.10037
Subject(s) - cartesian product , enhanced data rates for gsm evolution , mathematics , combinatorics , product (mathematics) , graph , point (geometry) , cartesian coordinate system , graph product , order (exchange) , discrete mathematics , 1 planar graph , computer science , chordal graph , geometry , telecommunications , finance , economics
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 K 2 × K n , n ≥ 2 (respectively, n ≥ 4), where K n 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.