Optimal orientation of the tensor product of a small diameter graph and a complete graph.
Rama Lakshmi · Australas. J Comb. · 2011
For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G, denoted by d(G), is defined as min{d(D) | D ∈ D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, a sufficient condition is given for d(G×Kn) = d(G×Kn), where G is a graph with d(G) two or three and × is the tensor product of graphs.