演講者：徐力行教授
單 位：靜宜大學資訊工程學系
日 期：2008年11月12日 PM 14:30
地 點：國立高雄大學理學院408室
講 題：Fault-tolerant hamiltonian connectedness of cycle composition networks
摘 要：
It is important for a network to tolerate as many faults as possible. With the graph representation of an interconnection network, a k-regular hamiltonian and hamiltonian connected network is super fault-tolerant hamiltonian if it remains hamiltonian after removing up to k -2 vertices and/or edges and remains hamiltonian connected after removing up to k - 3 vertices and/or edges. Super fault-tolerant hamiltonian networks have an optimal flavor with regard to the fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity. For this reason, a cycle composition framework was proposed to construct a (k + 2)-regular super fault-tolerant hamiltonian network based on a collection of n k-regular super fault-tolerant hamiltonian networks containing the same number of vertices for n>=3 and k >=4. Then we discuss the super fault-tolerant hamiltonian property of the folded Petersen graphs.
