Chitra,M R; Dr.Vijayakumar, A(Cochin University Of Science And Technology, September 2, 2013)
[+]
[-]
Abstract:
For routing problems in interconnection networks it is important
to find the shortest containers between any two vertices,
since the w-wide diameter gives the maximum communication
delay when there are up to w−1 faulty nodes in a network modeled
by a graph. The concept of ‘wide diameter’ was introduced
by Hsu [41] to unify the concepts of diameter and The concept of ‘domination’ has attracted interest due to
its wide applications in many real world situations [38]. A connected
dominating set serves as a virtual backbone of a network
and it is a set of vertices that helps in routing.
In this thesis, we make an earnest attempt to study some
of these notions in graph products. This include, the diameter
variability, the diameter vulnerability, the component factors
and the domination criticality.connectivity
Description:
Department of Mathematics
Cochin University of Science and Technology