Abstract
AbstractWe determine that the connectivity and the edge‐connectivity of the Cartesian product G1 × G2 of two strongly connected and finite digraphs G1 and G2 are equal to min{n1κ2,n2κ1,δ + δ, δ + δ} and min{n1λ2,n2λ1, δ + δ, δ + δ}, respectively, where ni, κi, λi, δ, δ are the order, the connectivity, the edge‐connectivity, the minimum out‐degree and the minimum in‐degree of Gi, respectively, for i = 1, 2. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
