The forwarding indices of augmented cubes

DOI10.1016/j.ipl.2006.09.013zbMath1185.05141MaRDI QIDQ845928

Min Xu, Jun-Ming Xu

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.09.013

zbMATH Keywords

combinatorial problems; forwarding index; augmented cubes; routings

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Fault-Tolerant Panconnectivity of Augmented Cubes AQn, Conditional edge-fault pancyclicity of augmented cubes, Edge-fault-tolerant vertex-pancyclicity of augmented cubes, Vertex-pancyclicity of augmented cubes with maximal faulty edges, Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position, Forwarding index of cube-connected cycles, Fault-tolerant panconnectivity of augmented cubes, The optimal routing of augmented cubes, The paths embedding of the arrangement graphs with prescribed vertices in given position, \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\), An upper bound for the crossing number of augmented cubes, The forwarding indices of wrapped butterfly networks, Automorphisms of augmented cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forwarding indices of Cartesian product graphs
• The forwarding index of communication networks with given connectivity
• Forwarding indices of \(k\)-connected graphs
• The edge-forwarding index or orbital regular graphs
• Edge-foreward index of star graphs and other Cayley graphs
• Forwarding indices of folded \(n\)-cubes
• On forwarding indices of networks
• The forwarding index of directed networks
• The forwarding index of communication networks
• Complexity of the Forwarding Index Problem
• The proof of a conjecture of Bouabdallah and Sotteau
• The Forwarding Indices of Random Graphs
• Forwarding indices of consistent routings and their complexity
• Computation of the forwarding index via flows: A note
• Theory and Application of Graphs
• Augmented cubes
• On the edge forwarding index problem for small graphs
• Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem