Pages that link to "Item:Q1120553"

The following pages link to Large fault-tolerant interconnection networks (Q1120553):

Displaying 41 items.

• Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles (Q479023) (← links)
• On the number of spanning trees and Eulerian tours in iterated line digraphs (Q674922) (← links)
• Connectivity of Kautz networks (Q685656) (← links)
• Edge, vertex and mixed fault diameters (Q840704) (← links)
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter (Q918987) (← links)
• Large fault-tolerant interconnection networks (Q1120553) (← links)
• The Hamiltonian property of generalized de Bruijn digraphs (Q1179462) (← links)
• Stirling networks: A versatile combinatorial topology for multiprocessor systems (Q1199419) (← links)
• The covering radius of Hadamard codes in odd graphs (Q1199453) (← links)
• Super edge-connectivity of dense digraphs and graphs (Q1199454) (← links)
• The underlying graph of a line digraph (Q1199455) (← links)
• Superconnectivity of bipartite digraphs and graphs (Q1292813) (← links)
• Extraconnectivity of \(s\)-geodetic digraphs and graphs (Q1296969) (← links)
• On the matrix equation \(A^l+A^{l+k}=J_n\) (Q1307521) (← links)
• The superconnectivity of large digraphs and graphs (Q1313826) (← links)
• On the distance connectivity of graphs and digraphs (Q1322268) (← links)
• On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks (Q1351611) (← links)
• Extraconnectivity of graphs with large minimum degree and girth (Q1356447) (← links)
• Fault-tolerant routings in double fixed-step networks (Q1377656) (← links)
• On the order and size of \(s\)-geodetic digraphs with given connectivity (Q1377819) (← links)
• Connectivity of large bipartite digraphs and graphs (Q1377820) (← links)
• Super line-connectivity of consecutive-\(d\) digraphs (Q1382814) (← links)
• Super link-connectivity of iterated line digraphs. (Q1401417) (← links)
• Diameter vulnerability of GC graphs (Q1408451) (← links)
• Efficient collective communciation in optical networks (Q1575944) (← links)
• Large \((d,D, D',s)\)-bipartite digraphs (Q1891920) (← links)
• Extension of de Bruijn graph and Kautz graph (Q1903209) (← links)
• Diameter vulnerability of iterated line digraphs (Q1910577) (← links)
• On the diameter vulnerability of Kautz digraphs (Q1916380) (← links)
• Diameter-vulnerability of large bipartite digraphs (Q1917252) (← links)
• Design of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. II (Q1917254) (← links)
• Bipartite graphs and digraphs with maximum connectivity (Q1923586) (← links)
• Approximate Moore graphs are good expanders (Q2284745) (← links)
• Mixed fault diameter of Cartesian graph bundles (Q2446299) (← links)
• On large (Δ, D, D, 1)-graphs (Q3087616) (← links)
• Miscellaneous Digraph Classes (Q3120443) (← links)
• Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
• On minimum locally $n$-(arc)-strong digraphs (Q4351243) (← links)
• (Q5009641) (← links)
• The covering radius of doubled 2-designs in \(2O_ k\) (Q5905437) (← links)
• The partial diagnosability of interconnection networks under the hybrid PMC model (Q6038695) (← links)