Wide diameters of Cartesian product graphs and digraphs

DOI10.1023/B:JOCO.0000031418.45051.8BzbMath1056.05048OpenAlexW2097661024MaRDI QIDQ1768608

Jun-Ming Xu

Publication date: 15 March 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joco.0000031418.45051.8b

zbMATH Keywords

networksconnectivityfault toleranceCartesian productwide diameter

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Distance in graphs (05C12) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (6)

Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ The vulnerability of the diameter of the enhanced hypercubes ⋮ Property P_d,m and efficient design of reliable networks ⋮ Wide diameter for two families of interconnection networks ⋮ On the diameter of the generalized undirected de Bruijn graphsUG_B(n,m),n²<m≤n³ ⋮ Randomly twisted hypercubes

This page was built for publication: Wide diameters of Cartesian product graphs and digraphs