The super edge connectivity of Kronecker product graphs

DOI10.1051/ro/2017080zbMath1398.05172OpenAlexW2765540968MaRDI QIDQ4553888

Gülnaz Boruzanlı Ekinci, Alpay Kırlangiç

Publication date: 1 November 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2017080

zbMATH Keywords

connectivityfault toleranceKronecker productsuper connectivitysuper edge connectivity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Uses Software

• KronFit

Cites Work

• Super connectivity of Kronecker product of complete bipartite graphs and complete graphs
• Proof of a conjecture on connectivity of Kronecker product of graphs
• On the super connectivity of Kronecker products of graphs
• On computing a conditional edge-connectivity of a graph
• A finite automata approach to modeling the cross product of interconnection networks.
• On edge connectivity of direct products of graphs
• Super connectivity of direct product of graphs
• Connectivity of Direct Products of Graphs
• The Kronecker Product of Graphs
• Independent sets in tensor graph powers
• Conditional connectivity
• SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS
• Hypercubes As Direct Products
• The Categorical Product of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The super edge connectivity of Kronecker product graphs