The super connectivity of the pancake graphs and the super laceability of the star graphs

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/33692

Title:	The super connectivity of the pancake graphs and the super laceability of the star graphs
Authors:	Lin,CK;Huang,HM;Hsu,LH
Contributors:	數學研究所
Keywords:	COMPLETE BINARY-TREES;FAULT-DIAMETER;INTERCONNECTION NETWORKS;HAMILTONIAN-LACEABILITY;CYCLES
Date:	2005
Issue Date:	2010-07-07 11:41:47 (UTC+8)
Publisher:	中央大學
Abstract:	A k-containerC(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k-container if it contains all the vertices of G. A graph G is k-connected if there exists a k*-container between any two distinct vertices. L
Relation:	THEORETICAL COMPUTER SCIENCE
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

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

社群 sharing