Combinatorial Properties of Root-fault Hypertrees

R. Sundara Rajan, R. Jayagopal, Indra Rajasingh, T.M. Rajalaxmi, N. Parthiban
2015 Procedia Computer Science  
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.
doi:10.1016/j.procs.2015.07.393 fatcat:w5k23zozqbhtpggsu3bnpk5ipi