On oriented diameter of (n,k)-star graphs

Assignment of one of two possible directions to every edge of an undirected graph G=(V,E) is called an orientation of G. The resulting directed graph is denoted by G⃗. A strong orientation is one in which every vertex is reachable from every other vertex via a directed path in G⃗. The diameter of G⃗, i.e., the maximum distance from any vertex to any other vertex, depends on the particular orientation. The minimum diameter among all possible orientations of G is called the oriented diameter diam⃗(G) of G. Let n,k be two integers such that 1≤kn2, n3更多