Combinatorial Properties of Root-fault Hypertrees
R. Sundara Rajan, R. Jayagopal, Indra Rajasingh, T. M. Rajalaxmi, N. Parthiban · Procedia Computer Science · 2015
Combinatorial properties have become more and more important recently in the study of reliability, fault tolerance, randomized routing, and transmission delay in interconnection networks. In this paper, we prove that hypertrees are planar. We also discuss certain combinatorial properties of root-fault hypertrees.