Restricted connectivity for some interconnection networks
From MaRDI portal
Publication:497373
DOI10.1007/s00373-014-1437-xzbMath1325.05100OpenAlexW1984370079MaRDI QIDQ497373
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1437-x
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)
Related Items (5)
Fault tolerance of recursive match networks based on \(g\)-good-neighbor fault pattern ⋮ Reliability evaluation for a class of recursive match networks ⋮ Under which conditions is λ″(G)=κ″(L(G)) ? ⋮ The \(h\)-restricted connectivity of the generalized hypercubes ⋮ The \(h\)-restricted connectivity of balanced hypercubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connectivity of Cartesian products of graphs
- On computing a conditional edge-connectivity of a graph
- Connectivity of minimal Cayley graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Über den Zusammenhang symmetrischer Graphen
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Circulants and their connectivities
- On unreliability polynomials and graph connectivity in reliable network synthesis
- On super connectivity of Cartesian product graphs
- Synthesis of reliable networks - a survey
- Graph theoretic reliability analysis for the Boolean n cube networks
- Complexity of network reliability computations
- Super edge- and point-connectivities of the Cartesian product of regular graphs
This page was built for publication: Restricted connectivity for some interconnection networks