ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS

DOI10.1142/S179383091000053XzbMath1215.05098OpenAlexW2003015813MaRDI QIDQ3575370

Chunxiang Wang

Publication date: 27 July 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

super-\(\lambda \)super edge-connectivity\(\lambda ^{\prime}\)-graphproduct graph \(G_{m} \ast G_{p}\)

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Large graphs with given degree and diameter. II
• On computing a conditional edge-connectivity of a graph
• On super edge-connectivity of Cartesian product graphs
• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
• On restricted edge-connectivity of graphs.

This page was built for publication: ON EDGE-CONNECTIVITY AND SUPER EDGE-CONNECTIVITY OF INTERCONNECTION NETWORKS MODELED BY PRODUCT GRAPHS