On the arrangement graph

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chiang, WK	en_US
dc.contributor.author	Chen, RJ	en_US
dc.date.accessioned	2014-12-08T15:49:05Z	-
dc.date.available	2014-12-08T15:49:05Z	-
dc.date.issued	1998-05-29	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://hdl.handle.net/11536/32611	-
dc.description.abstract	The arrangement graph was proposed as a generalization of the star graph topology. In this paper we investigate the topological properties of the (n, k)-arrangement graph A(n.k). It has been shown that the (n, n - 2)-arrangement graph A(n,n-2) is isomorphic to the n-alternating group graph AG,. In addition, the exact value of average distance of A(n,k) has been derived. (C) 1998 Published by Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	interconnection networks	en_US
dc.subject	graph isomorphism	en_US
dc.subject	average distance	en_US
dc.title	On the arrangement graph	en_US
dc.type	Article	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	66	en_US
dc.citation.issue	4	en_US
dc.citation.spage	215	en_US
dc.citation.epage	219	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000074822900009	-
dc.citation.woscount	22	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.