A note on the connectivity of Kronecker products of graphs

DOI10.1016/j.aml.2009.03.008zbMath1173.05331MaRDI QIDQ1033021

Raxida Guji, Elkin Vumar

Publication date: 6 November 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.03.008

zbMATH Keywords

bipartite graph; connectivity; separating set; Kronecker product; minimum degree

Mathematics Subject Classification ID

05C40: Connectivity

Related Items

SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS, Rainbow vertex-connection and graph products, Super connectivity of Kronecker product of complete bipartite graphs and complete graphs, On the edge connectivity of direct products with dense graphs, A characterization of the edge connectivity of direct products of graphs, Proof of a conjecture on connectivity of Kronecker product of graphs, On the super connectivity of Kronecker products of graphs, Connectivity of Kronecker products by \(K_2\), Super connectivity of Kronecker products of graphs, Proper connection number of graph products, On arc connectivity of direct-product digraphs, On edge connectivity of direct products of graphs, Rainbow connection and graph products, Connectivity of Kronecker products with complete multipartite graphs, CONNECTIVITY OF TENSOR PRODUCT OF GRAPHS

Cites Work

• 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 finite automata approach to modeling the cross product of interconnection networks.
• Independent sets in tensor graph powers
• ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
• Hypercubes As Direct Products