The edge connectivity of expanded \(k\)-ary \(n\)-cubes

DOI10.1155/2018/7867342zbMath1417.05113OpenAlexW2895236496MaRDI QIDQ1727252

Shi-ying Wang, Mujiangshan Wang

Publication date: 20 February 2019

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/7867342

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of design theory to circuits and networks (94C30) Connectivity (05C40)

Cites Work

• Unnamed Item
• Edge fault tolerance of graphs with respect to super edge connectivity
• Augmented \(k\)-ary \(n\)-cubes
• Edge-cuts leaving components of order at least three
• Super restricted edge-connectivity of graphs with diameter 2
• A sufficient condition for graphs to be super \(k\)-restricted edge connected
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• Lee distance and topological properties of k-ary n-cubes
• The connectivity and nature diagnosability of expandedk-aryn-cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes