Forwarding indices of \(k\)-connected graphs

DOI10.1016/0166-218X(92)90140-6zbMath0761.05054OpenAlexW1975938191MaRDI QIDQ1199433

S. Singh

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90140-6

zbMATH Keywords

networkpathsupper boundsconnectivityconnected graphroutingforwarding index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Related Items (8)

Upper bounds for the forwarding indices of communication networks ⋮ The forwarding indices of augmented cubes ⋮ The forwarding index of directed networks ⋮ The forwarding index of communication networks with given connectivity ⋮ Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem ⋮ Forwarding indices of folded \(n\)-cubes ⋮ On forwarding indices of networks ⋮ Unnamed Item

Cites Work

• The forwarding index of communication networks with given connectivity
• On forwarding indices of networks
• The forwarding index of communication networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forwarding indices of \(k\)-connected graphs