Large fault-tolerant interconnection networks

From MaRDI portal
Publication:1120553

DOI10.1007/BF01788663zbMath0672.94021OpenAlexW2014754781MaRDI QIDQ1120553

N. Homobono, Claudine Peyrat, Jean-Claude Bermond

Publication date: 1989

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788663




Related Items (41)

On minimum locally $n$-(arc)-strong digraphsEdge, vertex and mixed fault diametersLarge \((d,D, D',s)\)-bipartite digraphsOn fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networksExtraconnectivity of graphs with large minimum degree and girthExtension of de Bruijn graph and Kautz graphDiameter vulnerability of iterated line digraphsOn the diameter vulnerability of Kautz digraphsDiameter-vulnerability of large bipartite digraphsDesign of a \(d\)-connected digraph with a minimum number of edges and a quasiminimal diameter. IILarge fault-tolerant interconnection networksFault-tolerant routings in double fixed-step networksOn the order and size of \(s\)-geodetic digraphs with given connectivityConnectivity of large bipartite digraphs and graphsSuper line-connectivity of consecutive-\(d\) digraphsBipartite graphs and digraphs with maximum connectivityThe partial diagnosability of interconnection networks under the hybrid PMC modelSuper link-connectivity of iterated line digraphs.Diameter vulnerability of GC graphsUnnamed ItemDesign of a d-connected digraph with a minimum number of edges and a quasiminimal diameterMixed fault diameter of Cartesian graph bundlesImproved upper bounds for vertex and edge fault diameters of Cartesian graph bundlesThe Hamiltonian property of generalized de Bruijn digraphsOn the number of spanning trees and Eulerian tours in iterated line digraphsThe covering radius of doubled 2-designs in \(2O_ k\)Connectivity of Kautz networksStirling networks: A versatile combinatorial topology for multiprocessor systemsThe covering radius of Hadamard codes in odd graphsSuper edge-connectivity of dense digraphs and graphsThe underlying graph of a line digraphApproximate Moore graphs are good expandersOn large (Δ, D, D, 1)-graphsGraphs and Algorithms in Communication Networks on Seven League BootsEfficient collective communciation in optical networksSuperconnectivity of bipartite digraphs and graphsExtraconnectivity of \(s\)-geodetic digraphs and graphsMiscellaneous Digraph ClassesOn the matrix equation \(A^l+A^{l+k}=J_n\)The superconnectivity of large digraphs and graphsOn the distance connectivity of graphs and digraphs



Cites Work


This page was built for publication: Large fault-tolerant interconnection networks