標題: The correct diameter of trivalent Cayley graphs
作者: Tsai, CH
Hung, CN
Hsu, LH
Chang, CH
資訊工程學系
Department of Computer Science
關鍵字: trivalent Cayley graph;interconnection networks;diameter
公開日期: 26-十一月-1999
摘要: Let n be a positive integer with n greater than or equal to 2. The trivalent Cayley interconnection network, denoted by TCIN(n), is proposed by Vadapalli and Srimani (1995). Later, Vadapalli and Srimani (1996) claimed that the diameter of TCIN(n) is 2n - 1. In this paper, we argue that the above claim is not correct. Instead, we show that the diameter of TCIN(n) is 2n - 1 only for n = 2 and 2n - 2 for all other cases. (C) 1999 Elsevier Science B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/S0020-0190(99)00123-4
http://hdl.handle.net/11536/30958
ISSN: 0020-0190
DOI: 10.1016/S0020-0190(99)00123-4
期刊: INFORMATION PROCESSING LETTERS
Volume: 72
Issue: 3-4
起始頁: 109
結束頁: 111
顯示於類別:期刊論文


文件中的檔案:

  1. 000084628800006.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。