On edge connectivity of direct products of graphs

DOI10.1016/j.ipl.2011.06.007zbMath1260.05085MaRDI QIDQ1944162

Elkin Vumar, Simon Špacapan, Špela Brglez, Xiang-Lan Cao

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.06.007

zbMATH Keywords

combinatorial problems; connectivity; separating set; direct product; graph product

Mathematics Subject Classification ID

05C40: Connectivity

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

Related Items

The super edge connectivity of Kronecker product graphs, The Restricted Edge-Connectivity of Kronecker Product Graphs, SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS, On the edge connectivity of direct products with dense graphs, A characterization of the edge connectivity of direct products of graphs, Connectivity of semicartesian products, CONNECTIVITY OF TENSOR PRODUCT OF GRAPHS, Separation of Cartesian products of graphs into several connected components by the removal of edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on the Kronecker product of graphs
• Connectivity of Cartesian product graphs
• Vertex vulnerability parameters of Kronecker products of complete graphs
• Connectivity of Cartesian products of graphs
• A note on the connectivity of Kronecker products of graphs
• A finite automata approach to modeling the cross product of interconnection networks.
• Connectivity of strong products of graphs
• Computing the bipartite edge frustration of fullerene graphs
• Double graphs
• Independent sets in tensor graph powers
• ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
• Reliability of interconnection networks modeled by Cartesian product digraphs
• Hypercubes As Direct Products
• Edge-connectivity of strong products of graphs