The Number of Shortest Paths in the (n, k)-Star Graphs

DOI10.1007/978-3-642-17458-2_19zbMath1311.05089OpenAlexW1930907246MaRDI QIDQ3066159

Eddie Cheng, Ke Qiu, Zhizhang Shen

Publication date: 8 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17458-2_19

zbMATH Keywords

algorithmsnetworksgraphsshortest pathsminimum factorization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The number of shortest paths in the arrangement graph

This page was built for publication: The Number of Shortest Paths in the (n, k)-Star Graphs