Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Synthesis of reliable networks - a survey - MaRDI portal

Synthesis of reliable networks - a survey

From MaRDI portal
Publication:3740538

DOI10.1109/TR.1986.4335424zbMath0603.90060OpenAlexW2088535325MaRDI QIDQ3740538

No author found.

Publication date: 1986

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tr.1986.4335424



Related Items

On \(g\)-extra connectivity of hypercube-like networks, Toughness of the corona of two graphs, The super connectivity of folded crossed cubes, The super-connectivity of Kneser graphs, Superconnected digraphs and graphs with small conditional diameters, LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS, Network design and defence, Edge-connectivity and edge-superconnectivity in sequence graphs, Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions, Heuristic maximization of the number of spanning trees in regular graphs, Optimally Reliable Graphs for Both Vertex and Edge Failures, On the restricted connectivity and superconnectivity in graphs with given girth, A new approach to finding the extra connectivity of graphs, On the super‐restricted arc‐connectivity of s ‐geodetic digraphs, A bootstrap heuristic for designing minimum cost survivable networks, Connectivity and super connectivity of the exchanged 3-ary \(n\)-cube, Fault tolerability analysis of folded crossed cubes based on \(g\)-component and \(g\)-good neighbor fault pattern, Superconnectivity of graphs with odd girth \(g\) and even girth \(h\), Connectivity and super connectivity of folded hypercube-like networks, The super connectivity of exchanged crossed cube, Network reliability: Heading out on the highway, Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes, Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs, Restricted arc-connectivity of unidirectional star graphs, Under which conditions is λ″(G)=κ″(L(G))  ?, The Menger number of the Cartesian product of graphs, Super-connected but not super edge-connected graphs, Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity, The super connectivity of exchanged hypercubes, On the super connectivity of Kronecker products of graphs, On vosperian and superconnected vertex-transitive digraphs, Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses, On super connectivity of Cartesian product graphs, Small cutsets in arc-transitive digraphs of prime degree, A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications, Super connectivity of balanced hypercubes, Superconnected and hyperconnected small degree transitive graphs, Super-connected and hyper-connected jump graphs, Diameter-girth sufficient conditions for optimal extraconnectivity in graphs, Optimally reliable networks, On the edge-connectivity and restricted edge-connectivity of a product of graphs, Super connectivity of folded twisted crossed cubes, Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors, Restricted connectivity for some interconnection networks, On \(g\)-extra connectivity of folded hypercubes, Capacity factors in a point-to-point network, Connectivity measures in matched sum graphs, Super edge-connectivity of dense digraphs and graphs, Design of reliable networks, The super connectivity of augmented cubes, Edge fault tolerance analysis of super \(k\)-restricted connected networks, On the connectivity and superconnected graphs with small diameter, The existence and upper bound for two types of restricted connectivity, Connectivity and super connectivity of the divide-and-swap cube, Semi-hyper-connected edge transitive graphs, Connectedness of digraphs and graphs under constraints on the conditional diameter, Diameter, short paths and superconnectivity in digraphs, On restricted connectivities of permutation graphs, Super edge connectivity properties of connected edge symmetric graphs, A survey of some network reliability analysis and synthesis results, The reliability of lexicographic product digraphs, Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs, Super \(p\)-restricted edge connectivity of line graphs, Diameter-sufficient conditions for a graph to be super-restricted connected, On the connectivity and restricted edge-connectivity of 3-arc graphs, Semi-hyper-connected vertex transitive graphs, Component conditional fault tolerance of hierarchical folded cubic networks, Sufficient conditions for super-arc-strongly connected oriented graphs, Connectivity of vertex and edge transitive graphs, Strongly edge triangle regular graphs and a conjecture of Kotzig, Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\), Superconnectivity of regular graphs with small diameter, On the 3-restricted edge connectivity of permutation graphs, Super-connected arc-transitive digraphs, Edge-superconnectivity of semiregular cages with odd girth, Super connectivity of line graphs, Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected, Superconnectivity of bipartite digraphs and graphs, On the Superconnectivity in graphs with odd girth g and even girth h, The expected number of pairs of connected nodes: Pair-connected reliability, Analysis and synthesis problems for network resilience, The superconnectivity of large digraphs and graphs, Highly connected star product graphs, Reliability analysis of the generalized balanced hypercube, Realizability of fault-tolerant graphs