Exact assessment of the super Pk-connectivity for the crossed cube interconnection network

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/115549

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/115549

題名:	Exact assessment of the super Pk-connectivity for the crossed cube interconnection network
作者:	龔自良;KUNG, TZU-LIANG
貢獻者:	資訊電機學院資訊工程學系
日期:	2022-03-01
上傳時間:	2023-03-29 02:44:48 (UTC+0)
出版者:	亞洲大學
摘要:	A network is connected if there exists a path between any two distinct vertices. The vertex-connectivity of any connected network is the cardinality of its minimum vertex-cut. Then, a network is super connected if every of its minimum vertex-cuts always consists of a certain vertex’s neighborhood. Kung and Lin (Discret Appl Math 293: 143–156, 2021) recently defined the notion of the super cluster-connectivity as a novel, generalized measure to quantify a network’s connectedness level. This article is dedicated to establishing a deep analysis on the exact formula of super path-connectivity for the crossed cube interconnection network. Accordingly, a sufficient and necessary condition is presented to classify whether or not crossed cubes can be super path-connected.
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	60	檢視/開啟

在ASIAIR中所有的資料項目都受到原著作權保護.