Title of article
Tenacity and some related results
Author/Authors
Moazzami, D Department of Engineerng Science - College of Engineering - University of Tehran
Pages
9
From page
83
To page
91
Abstract
Conceptually graph vulnerability relates to the study of
graph intactness when some of its elements are removed.
The motivation for studying vulnerability measures is
derived from design and analysis of networks under hostile
environment. Graph tenacity has been an active
area of research since the the concept was introduced in
1992.
The tenacity T(G) of a graph G is dened as
T(G) = min
AV (G)
f
j A j + (G A)
!(G A)
g
where (G A) denotes the order (the number of vertices)
of a largest component of G-A and !(G A) is
the number of components of G-A.
In this paper we discuss tenacity and its properties in
vulnerability calculation.
Keywords
vertex connectivity , toughness , binding number , independence number , edge-connectivity
Journal title
Astroparticle Physics
Serial Year
2017
Record number
2469456
Link To Document