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. © 2015 The Authors. Published by Elsevier B.V.

Jayagopal R

Mathematics

School of Advanced Sciences

Chennai Campus

Indra Rajasingh

Rajan R.S

Rajalaxmi T.M

Parthiban N.

Fulltext

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Procedia Computer Science

A locating-dominating set (LDS) of a graph G is a dominating set S of G such that for every two vertices u and v in V(G)∖S, N(u)∩S≠N(v)∩S. The locating-domination number γL(G) is the minimum cardinality of a LDS of G. Further if S is a total dominating set then S is called a locating-total dominating set. In this paper we determine the domination, total domination, locating-domination and locating-total domination numbers for hypertrees and sibling trees. © 2020 Elsevier B.V.

Discrete Applied Mathematics

Domination parameters in hypertrees and sibling trees

The decycling number of a graph G denoted by Δ (G), is the smallest number of vertices that can be deleted from G so that the resultant graph contains no cycles. The cycle packing number of a graph G denoted byc(G), is the maximum number of vertex disjoint cycles in G. It is clear that c(G)≤.Δ(G) We find certain networks for which decycling number equals the cycle packing number. © 2015 The Authors. Published by Elsevier B.V.

Tree Derived Architectures with Decycling Number Equal to Cycle Packing Number

Hypercubes are a very popular model for parallel computation because of their regularity and the relatively small number of interprocessor connections. In this paper, we present an algorithm for embedding special class of circulant networks into their optimal hypercubes with dilation 2 and prove its correctness. Also, we embed special class of circulant networks into special class of generalized Petersen graphs with dilation 2 and vice versa. © 2012 Taylor &amp; Francis.

Journal	Data powered by TypesetProcedia Computer Science
Publisher	Data powered by TypesetElsevier BV
ISSN	1877-0509
Open Access	Yes