| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428662 | Information Processing Letters | 2010 | 5 Pages |
Abstract
In this paper, we consider each integer d between the lower and upper orientable strong diameter of the complete k-partite graph K(m1,m2,…,mk), and show that there does exist a strong orientation of K(m1,m2,…,mk) such that sdiam(K)=d.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
