Abstract
The strong product G1 £G2 of graphs G1 and G2 is the graph with V (G1) × V (G2) as the vertex set, and two distinct vertices (x1, x2) and (y1, y2) are adjacent whenever for each i ∈ {1, 2} either xi = yi or xiyi ∈ E(Gi). In this note we show that for two connected graphs G1 and G2 the edge-connectivity λ(G1£G2) equals min{δ(G1£ G2), λ(G1)(|V (G2)|+2|E(G2)|), λ(G2)(|V (G1)|+2|E(G1)|)}. In addition, we fully describe the structure of possible minimum edge cut sets in strong products of graphs.
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.
