QQ客服 官方微博 反馈留言

	Strong Distances in Strong Oriented Complete k-Partite Graphs
	Miao, Huifang ; Guo, Xiaofeng ; Guo XF(郭晓峰)
	2011-10
关键词	Oriented complete k-partite graph Strong distance Strong radius Strong diameter
英文摘要	Fundamental Research Funds for the Central Universities, China [2010121076]; National Natural Science Foundation of China [11026055]; 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. The strong diameter sdiam(D) is the maximum strong eccentricity among the vertices of D. In this paper, we investigate the strong distances in strong oriented complete k-partite graphs. For any integers delta, r, d with 0 <= delta <= [k/2] - 1, 3 <= r <= [k/2] + 1, 4 <= d <= k, we have shown that there are strong oriented complete k-partite graphs K', K '', K''' such that sdiam(K') - srad(K') = delta, srad(K '') = r, and sdiam(K''') = d.
语种	英语
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/66730]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	Miao, Huifang,Guo, Xiaofeng,Guo XF. Strong Distances in Strong Oriented Complete k-Partite Graphs[J],2011.
APA	Miao, Huifang,Guo, Xiaofeng,&郭晓峰.(2011).Strong Distances in Strong Oriented Complete k-Partite Graphs..
MLA	Miao, Huifang,et al."Strong Distances in Strong Oriented Complete k-Partite Graphs".(2011).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。