<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

Equivalent nondegenerate L-shapes of double-loop networks

dc.citation.epage125en_US
dc.citation.issue2en_US
dc.citation.spage118en_US
dc.citation.volume36en_US
dc.citation.woscount2
dc.contributor.authorChen, CYen_US
dc.contributor.authorHwang, FKen_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.date.accessioned2014-12-08T15:44:51Z
dc.date.available2014-12-08T15:44:51Z
dc.date.issued2000-09-01en_US
dc.description.abstractDouble-loop networks have been widely studied as architecture for local area networks. The L-shape is an important tool for studying the distance properties of double-loop networks. Two L-shapes are equivalent if the numbers of nodes k steps away from the origin are the same for every k, Hwang and Xu first studied equivalent L-shapes through a geometric operation called 3-rectangle transformation. Fiol et al. proposed three equivalent transformations. Rodseth gave an algebraic operation, which was found by Huang et al, to correspond to 3-rectangle transformations, In this paper, we show that all equivalent nondegenerate L-shapes are determined by four basic geometric operations. We also discuss the algebraic operations corresponding to these geometric operations. (C) 2000 John Wiley & Sons, Inc.en_US
dc.identifier.issn0028-3045en_US
dc.identifier.journalNETWORKSen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/30276
dc.identifier.wosnumberWOS:000089089900007
dc.language.isoen_USen_US
dc.subjectdouble-loop networken_US
dc.subjectL-shapeen_US
dc.subjectdiameteren_US
dc.subjectEuclidean algorithmen_US
dc.titleEquivalent nondegenerate L-shapes of double-loop networksen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
000089089900007.pdf
Size:
149.24 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: