Networks communicating for each pairing of terminals

DOI10.1002/NET.3230220702MaRDI QIDQ4022728zbMATH OpenOpenAlexFDO

Authors László Csaba, Ralph Faudree, András Gyárfás, Jeno Lehel, R. H. Schelp

Publication date 17 January 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230220702

zbMATH Keywords

\((\Delta,t)\)-networkmultigraph of maximum degreeterminals

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 90343
• Connectivity
• The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
• An improved upper bound on the maximum degree of terminal-pairable complete graphs
• Design of fault-tolerant on-board networks with variable switch sizes

Cites work

• A sufficient condition for graphs to be weakly \(k\)-linked
• A Theorem on Coloring the Lines of a Network
• scientific article; zbMATH DE number 434691 (Why is no real title available?)
• Three-regular path pairable graphs

Cited in

(22)

• Three-regular path pairable graphs
• A communication problem and directed triple systems
• Linkage on the infinite grid
• Terminal-pairability in complete bipartite graphs
• The minimum size of graphs satisfying cut conditions
• On path-pairability of the finite grids
• Path-pairability of infinite planar grids
• Note on the bisection width of cubic graphs
• On the maximum diameter of path-pairable graphs
• The path-pairability number of product of stars
• On the maximum degree of path-pairable planar graphs
• Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
• Minimal 2-connected graphs satisfying the even cut condition
• The terminal-pairability problem in complete bipartite graphs
• scientific article; zbMATH DE number 4018401 (Why is no real title available?)
• Length-constrained path-matchings in graphs
• scientific article; zbMATH DE number 90343 (Why is no real title available?)
• A degree sequence problem related to network design
• Note on the diameter of path-pairable graphs
• Note on terminal-pairability in complete grid graphs
• An improved upper bound on the maximum degree of terminal-pairable complete graphs
• On path-pairability in the Cartesian product of graphs

This page was built for publication: Networks communicating for each pairing of terminals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022728)