A characterization of the edge connectivity of direct products of graphs

DOI10.1016/j.disc.2013.02.011zbMath1279.05064arXiv1208.4995OpenAlexW1974215677MaRDI QIDQ389496

Simon Špacapan

Publication date: 20 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.4995

zbMATH Keywords

direct productedge connectivity

Mathematics Subject Classification ID

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

Related Items (6)

Proper connection number of graph products ⋮ Connectivity of strong products of graphs ⋮ Connectivity of Kronecker products with complete multipartite graphs ⋮ Connectivity of semicartesian products ⋮ Matching preclusion for direct product of regular graphs ⋮ Separation of Cartesian products of graphs into several connected components by the removal of edges

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of a conjecture on connectivity of Kronecker product of graphs
• The bipartite edge frustration of composite graphs
• On optimizing edge connectivity of product graphs
• Connectivity of Kronecker products by \(K_2\)
• Super connectivity of Kronecker products of graphs
• The bipartite edge frustration of extension of splice and link graphs
• Connectivity of Cartesian products of graphs
• On super edge-connectivity of product graphs
• A note on the connectivity of Kronecker products of graphs
• On edge connectivity of direct products of graphs
• Connectivity of strong products of graphs
• Computing the bipartite edge frustration of fullerene graphs
• Connectivity of Direct Products of Graphs
• The Kronecker Product of Graphs
• ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
• Edge-connectivity of strong products of graphs

This page was built for publication: A characterization of the edge connectivity of direct products of graphs