Strong orientations of complete k-partite graphs achieving the strong diameter

Authors:
Huifang Miao;Guoping Lin
Affiliations:
Department of Communication Engineering, Xiamen University, Xiamen Fujian 361005, PR China;Department of Mathematics and Information Science, Zhangzhou Normal University, Zhangzhou 363000, PR China
Venue:
Information Processing Letters
Year:
2010

Citing 3
Cited 0

On strong distances in oriented graphs

Discrete Mathematics - Special issue: The 18th British combinatorial conference
Lower and upper orientable strong radius and strong diameter of complete k-partite graphs

Discrete Applied Mathematics
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider each integer d between the lower and upper orientable strong diameter of the complete k-partite graph K(m"1,m"2,...,m"k), and show that there does exist a strong orientation of K(m"1,m"2,...,m"k) such that sdiam(K)=d.