Strongly self-centered orientation of complete k-partite graphs

CORC > 厦门大学 > 信息技术－已发表论文

	Strongly self-centered orientation of complete k-partite graphs
	Miao, Huifang ; Yang, Weihua ; Mou HF(缪惠芳)
刊名	http://dx.doi.org/10.1016/j.dam.2014.05.026
	2014
关键词	Combinatorial mathematics Mathematical techniques
英文摘要	For two vertices u and v in a strong oriented graph D, the strong distance sd(u,v) between u and v is the minimum size (the number of arcs) of a strong sub-digraph of D containing u and v. For a vertex v of D, the strong eccentricity se(v) is the strong distance between v and a vertex farthest from v. The strong radius srad(D) is the minimum strong eccentricity among the vertices of D, and the strong diameter sdiam(D) is the maximum strong eccentricity among the vertices of D. An orientation D of a graph G is said to be a strongly self-centered orientation of G if srad(D)=sdiam(D). In this paper, we obtain some conditions for complete k-partite graphs to have strongly self-centered orientations. Our results generalize a result on tournaments in Chartrand et al. (1999). ? 2014 Elsevier B.V. All rights reserved.
语种	英语
出版者	Elsevier
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/92875]
专题	信息技术－已发表论文
推荐引用方式 GB/T 7714	Miao, Huifang,Yang, Weihua,Mou HF. Strongly self-centered orientation of complete k-partite graphs[J]. http://dx.doi.org/10.1016/j.dam.2014.05.026,2014.
APA	Miao, Huifang,Yang, Weihua,&缪惠芳.(2014).Strongly self-centered orientation of complete k-partite graphs.http://dx.doi.org/10.1016/j.dam.2014.05.026.
MLA	Miao, Huifang,et al."Strongly self-centered orientation of complete k-partite graphs".http://dx.doi.org/10.1016/j.dam.2014.05.026 (2014).