Dept. of Comput. Sci. & Inf. Eng., National Taiwan Univ.Su, Ming-YangMing-YangSuChen, Gen-HueyGen-HueyChenDuh, Dyi-RongDyi-RongDuh2007-04-192018-07-052007-04-192018-07-051996-0600283045https://www.scopus.com/inward/record.uri?eid=2-s2.0-0041175843&doi=10.1002%2f%28SICI%291097-0037%28199808%2932%3a1%3c23%3a%3aAID-NET3%3e3.0.CO%3b2-L&partnerID=40&md5=f3994b22530f3f834b3cf843242259ffRecently, WK-recursive networks have received much attention due to their many favorable properties. However, they suffered from a rigorous restriction on their sizes. Incomplete WK-recursive networks were proposed to relieve this restriction. In this paper, the topological properties of incomplete WK-recursive networks are investigated. It is shown that they contain Hamiltonian cycles if their connectivities are greater than one. A sufficient and necessary condition is also proposed for those with connectivity one to contain a Hamiltonian path. A linear-time algorithm using the prune-and-search technique is presented to compute their diameters. © 1998 John Wiley & Sons, Inc. Networks 32: 23-45, 1998.application/pdf778305 bytesapplication/pdfen-USDiameter; Hamiltonian cycle; Incomplete WK-recursive networks; WK-recursive networksjournal article10.1109/ICAPP.1996.5628672-s2.0-0041175843http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910031952/1/00562867.pdf