We study the zero-undetected-error capacity of the discrete memoryless channel whose directed channel graph is the cyclic triangle. We show that this capacity is upper-bounded by log 2 and approaches log 2 as the crossover probabilities tend to zero.