Connectivity for some families of composition networks

DOI10.1016/j.tcs.2022.04.036OpenAlexW4293072302MaRDI QIDQ2672600

Yanyan Li

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.036

zbMATH Keywords

connectivitymatching composition networkscycle composition networks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure connectivity and substructure connectivity of hypercubes
• Conditional diagnosability of the round matching composition networks
• Conditional diagnosability of a class of matching composition networks under the comparison model
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
• Recognizing Cartesian products in linear time
• Extraconnectivity of graphs with large girth
• On the extraconnectivity of graphs
• Diagnosability for two families of composition networks
• Restricted connectivity for three families of interconnection networks
• Component connectivity of the hypercubes
• Conditional connectivity
• The Mobius cubes

This page was built for publication: Connectivity for some families of composition networks