Mutually independent hamiltonian paths in star networks

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

Title:	Mutually independent hamiltonian paths in star networks
Authors:	Lin,CK;Huang,HM;Hsu,LH;Bau,S
Contributors:	數學研究所
Keywords:	FAULT-DIAMETER;SPANNING-TREES;GRAPHS
Date:	2005
Issue Date:	2010-07-07 11:41:31 (UTC+8)
Publisher:	中央大學
Abstract:	Two hamiltonian paths P-1 = < u(1),u(2),...,u(n(G))> and P-2 = < v(1), v(2),...,v(n(G))> of G from u to v are independent if u = u(1) = v(1), v = v(n(G)) = u(n(G)), and v(j) not equal u(i) for every 1 < i < n(G). A set of hamiltonian paths, {P-1, P-2,...,
Relation:	NETWORKS
Appears in Collections:	[Graduate Institute of Mathematics] journal & Dissertation

Files in This Item:

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

社群 sharing