 CARMA DISCRETE MATHEMATICS INSTRUCTIONAL SEMINAR
 Speaker: Elgin Kilic, The University of Newcastle
 Title: Some Vulnerability Measures and Total Accessibility
 Location: Room V101, Mathematics Building (Callaghan Campus) The University of Newcastle
 Time and Date: 3:00 pm, Thu, 16^{th} May 2013
 Abstract:
Vulnerability is the resistance of a network after any
disruptions in its links or nodes. Since any network can be modelled by
a graph, many vulnerability measures were defined to observe the
resistance of networks. For this purpose vulnerability measures such as
connectivity,integrity, toughness etc., have been studied widely over
all vertices of a graph. In recent many researches began to study on
vulnerability measures on graphs over vertices or edges which have a
special property rather than over all vertices of the graph.
Independent domination, connected domination and total domination
measures are examples of such these measures. Total Accessibility number
of a graph is defined as a new measure by choosing the accessible sets $S \subset V$
which have a special property accesibility. Total Accessibility
number of a graph G is based on the accessibility number of a graph. The
subsets S are accessible sets of the graph. Accessibility number of any
connected graph G is a concept based on neighborhood relation between
any two vertices by using another vertex connected to both these two
vertices.
 [Permanent link]
