@article {
author = {Lakshmi, R. and Rajasekaran, G. and Sampathkumar, R.},
title = {Optimal orientations of subgraphs of complete bipartite graphs},
journal = {Transactions on Combinatorics},
volume = {4},
number = {1},
pages = {19-29},
year = {2015},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2015.4725},
abstract = {For a graph $G,$ let $\mathscr{D}(G)$ be the set of all strong digraphs $D$ obtained by the orientations of $G.$ The orientation number of $G$ is $\stackrel{\rightarrow}{d}\!\!(G)\,=$ min $\{d(D)\,|\,D\,\in\,\mathscr{D}(G)\},$ where $d(D)$ denotes the diameter of the digraph $D.$ In this paper, we determine the orientation number for some subgraphs of complete bipartite graphs.},
keywords = {subgraphs of complete bipartite graphs,orientation,orientation number,$Z_2^n$-partition,$Z_2^n$-set},
url = {https://toc.ui.ac.ir/article_4725.html},
eprint = {https://toc.ui.ac.ir/article_4725_ab6061f1b408a4d9a9b58cff4bb6771c.pdf}
}