A finite automata approach to modeling the cross product of interconnection networks.

DOI10.1016/S0895-7177(99)00173-9zbMath1042.68505MaRDI QIDQ1597031

S. A. Ghozati

Publication date: 5 May 2002

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Formal languages and automata (68Q45)

Related Items (13)

A note on the connectivity of direct products of graphs ⋮ Super connectivity of Kronecker product of complete bipartite graphs and complete graphs ⋮ The super edge connectivity of Kronecker product graphs ⋮ Wiener and vertex \(PI\) indices of Kronecker products of graphs ⋮ The Restricted Edge-Connectivity of Kronecker Product Graphs ⋮ A Heuristic for Direct Product Graph Decomposition ⋮ On edge connectivity of direct products of graphs ⋮ On the super connectivity of Kronecker products of graphs ⋮ ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS ⋮ SUPER EDGE CONNECTIVITY OF KRONECKER PRODUCTS OF GRAPHS ⋮ Vertex vulnerability parameters of Kronecker products of complete graphs ⋮ Super connectivity of Kronecker products of graphs ⋮ A note on the connectivity of Kronecker products of graphs

Cites Work

• Product-shuffle networks: Toward reconciling shuffles and butterflies
• A unified framework for off-line permutation routing in parallel networks
• A general framework for developing adaptive fault-tolerant routing algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A finite automata approach to modeling the cross product of interconnection networks.