T-span and T-edge span of some Cayley graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 92 === With the development of network and parallel computers, the problems of interconnection network are more and more important. How do we make the efficiency to be optimal and how to reduce the cost are main goals of there problems. The properties of Cayley graph a...
Main Authors: | Wu Pin Hsien, 吳品賢 |
---|---|
Other Authors: | Justie Su-tzu Juan |
Format: | Others |
Language: | en_US |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/33248809698410721590 |
Similar Items
-
On the Study of Feedback Problems and Independent Spanning Trees in Cayley Graphs
by: Chi-Jung Kuo, et al.
Published: (2010) -
The Edge Span of Graph Distance Three Labelling
by: Ji-wei Huang, et al.
Published: (2009) -
The edge spans of L(p,q)-labelings on graphs
by: Hong-Bin Chen, et al.
Published: (2003) -
Ranking graph edges by the weight of their spanning arborescences or trees
by: Paulo Oswaldo Boaventura-Netto
Published: (2008-04-01) -
Edge-Transitivity of Cayley Graphs Generated by Transpositions
by: Ganesan Ashwin
Published: (2016-11-01)