On the spanning w-wide diameter of the star graph

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

Title:	On the spanning w-wide diameter of the star graph
Authors:	Lin,Cheng-Kuan;Huang,Hua-Min;Hsu,D. Frank;Hsu,Lih-Hsing
Contributors:	數學研究所
Keywords:	FAULT-FREE PATHS;HAMILTONIAN-LACEABILITY;SUPER LACEABILITY;PANCAKE GRAPHS;VERTEX FAULTS;NETWORKS;HYPERCUBES;TREES
Date:	2006
Issue Date:	2010-07-07 11:41:00 (UTC+8)
Publisher:	中央大學
Abstract:	Let a and v be any two distinct nodes of an undirected graph G, which is k-connected. A container C(u, v) between a and v is a set of internally disjoint paths {P-1, P-2,..., P-W} between a and v where 1 <= w <= k. The width of C(u, v) is w and the length
Relation:	NETWORKS
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

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

社群 sharing