Title :
Comments on "On Hamiltonian Cycles as Optimal p-Cycles"
Author_Institution :
Dept. of Telecommun., AGH Univ. of Sci. & Technol., Krakow
Abstract :
For original paper by D.A. Schupke see ibid., vol.9, no 4, p.360-2, April 2005. It is shown that in the above letter by Schupke corollaries related to a necessary condition on the network to ensure that a set of Hamiltonian p-cycles is able to reach the theoretical logical redundancy bound are wrongly calculated.
Keywords :
graph theory; information theory; telecommunication networks; Hamiltonian cycles; logical redundancy bound; optimal p-cycles; Associate members; Computer errors; Equations; Protection; Redundancy; Scholarships;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2007.061888
