.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
The star graph interconnection network has been introduced as an attractive alternative to the hypercube network. In this paper, we consider the path embedding problem in star graphs. Assume that n >= 4. We prove that paths of all even lengths from d(x, y) to n! - 2 can be embedded between two arbitrary vertices x and y from the same partite set in the n-dimensional star graph. In addition, paths of all odd lengths from d(x, y) to n! - 1 can be embedded between two arbitrary vertices x and y from different partite sets in the n-dimensional star graph except that if x and y are adjacent, there is no path of length 3 between them. The result is optimal in the sense that paths of all possible lengths are found in star graphs. (C) 2008 Elsevier Inc. All rights reserved.
Keyword:
Path
Embedding
Star graph
Interconnection network
Hamiltonian
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
DEEP PHENOTYPING REVEALS A HIGH PREVALENCE OF DISTRESSING BLEEDING SYMPTOMS IN PATIENTS WITH HYPERMOBILE EHLERS DANLOS SYNDROME (HEDS) SPECTRUM DISEASE深度表型分析揭示，在患有关节过度活动型埃勒斯-当洛斯综合征（HEDS）谱系疾病的患者中，存在高比例的令人痛苦的出血症状。.png)
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏
查看更多内容