Upper bounds for the forwarding indices of communication networks

DOI10.1016/j.disc.2004.05.011zbMath1114.90008OpenAlexW2051141945MaRDI QIDQ1887642

Yanyan Li

Publication date: 22 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.05.011

zbMATH Keywords

ConnectivityGraphInterconnectionNetwork

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Circuits, networks (94C99) Connectivity (05C40)

Related Items (4)

The forwarding index of directed networks ⋮ Forwarding index of cube-connected cycles ⋮ On the restricted forwarding index problem in communication networks ⋮ The forwarding diameter of graphs

Cites Work

• The forwarding index of communication networks with given connectivity
• Forwarding indices of \(k\)-connected graphs
• On forwarding indices of networks
• Complexity of the Forwarding Index Problem
• A homology theory for spanning tress of a graph
• Unnamed Item

This page was built for publication: Upper bounds for the forwarding indices of communication networks