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

ASIAIR > College of Computer Science > Department of Computer Science and Information Engineering > Journal Artical > Item 310904400/115549

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/115549

Title:	Exact assessment of the super Pk-connectivity for the crossed cube interconnection network
Authors:	龔自良;KUNG, TZU-LIANG
Contributors:	資訊電機學院資訊工程學系
Date:	2022-03-01
Issue Date:	2023-03-29 02:44:48 (UTC+0)
Publisher:	亞洲大學
Abstract:	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.
Appears in Collections:	[Department of Computer Science and Information Engineering] Journal Artical

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	59	View/Open