Separation of Cartesian products of graphs into several connected components by the removal of edges

DOI10.2298/AADM160719018SzbMath1499.05336MaRDI QIDQ3390790

Simon Špacapan

Publication date: 25 March 2022

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Cartesian productsgeneralized connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of the edge connectivity of direct products of graphs
• Large graphs with given degree and diameter. II
• Connectivity of Cartesian products of graphs
• On edge connectivity of direct products of graphs
• Connectivity of strong products of graphs
• On the edge-connectivity and restricted edge-connectivity of a product of graphs
• On the generalized (edge-)connectivity of graphs
• Generalized Connectivity of Graphs
• Rainbow trees in graphs and generalized connectivity
• Reliability of interconnection networks modeled by a product of graphs
• ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
• Separation of graphs into three components by the removal of edges
• Superconnectivity of networks modeled by the strong product of graphs
• Edge-connectivity of strong products of graphs

This page was built for publication: Separation of Cartesian products of graphs into several connected components by the removal of edges