SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS

DOI10.1142/S0129054114500038zbMath1303.05096OpenAlexW2066939257MaRDI QIDQ5168424

Xiang-Lan Cao, Elkin Vumar

Publication date: 4 July 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054114500038

zbMATH Keywords

Kronecker productcomplete graphedge cutsuper edge connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

The super edge connectivity of Kronecker product graphs

Cites Work

• Super connectivity of Kronecker products of graphs
• Connectivity of Cartesian product graphs
• Vertex vulnerability parameters of Kronecker products of complete graphs
• A note on the connectivity of Kronecker products of graphs
• A finite automata approach to modeling the cross product of interconnection networks.
• On edge connectivity of direct products of graphs
• Connectivity of strong products of graphs
• Double graphs
• Independent sets in tensor graph powers
• ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
• Hypercubes As Direct Products

This page was built for publication: SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS