The super spanning connectivity and super spanning laceability of the enhanced hypercubes

NCU Institutional Repository > 理學院 > 數學研究所 > 期刊論文 > Item 987654321/27966

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/27966

题名:	The super spanning connectivity and super spanning laceability of the enhanced hypercubes
作者:	Chang,CH;Lin,CK;Tan,JJM;Huang,HM;Hsu,LH
贡献者:	數學研究所
关键词:	GRAPHS;NETWORKS
日期:	2009
上传时间:	2010-06-29 19:39:06 (UTC+8)
出版者:	中央大學
摘要:	A k -container C(u,v) of a graph G is a set of k disjoint paths between u and v. A k-container C(u,v) of G is a k () -container if it contains all vertices of G. A graph G is k () -connected if there exists a k ()-container between any two distinct vertices of G. Therefore, a graph is 1()-connected (respectively, 2()-connected) if and only if it is Hamiltonian connected (respectively, Hamiltonian). A graph G is super spanning connected if there exists a k ()-container between any two distinct vertices of G for every k with 1a parts per thousand currency signka parts per thousand currency sign kappa(G) where kappa(G) is the connectivity of G. A bipartite graph G is k () -laceable if there exists a k ()-container between any two vertices from different partite set of G. A bipartite graph G is super spanning laceable if there exists a k (*)-container between any two vertices from different partite set of G for every k with 1a parts per thousand currency signka parts per thousand currency sign kappa(G). In this paper, we prove that the enhanced hypercube Q (n,m) is super spanning laceable if m is an odd integer and super spanning connected if otherwise.
關聯:	JOURNAL OF SUPERCOMPUTING
显示于类别:	[數學研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	556	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....