Geodesic
Measures for graph integrity: a~comparative survey
Prikladnaâ diskretnaâ matematika, no. 4 (2014), pp. 96-111

Voir la notice de l'article provenant de la source Math-Net.Ru

The brief overview of deterministic graph integrity measures is presented. The well-known relationships between them are given. Some estimates for these measures expressed through the traditional numerical graph parameters are given too. A relationship between the computational complexity of the integrity measures and damage models in graphs is analyzed. Some unsolved problems are pointed.
Keywords: graphs, vulnerability, integrity, toughness, scattering number, tenacity, rupture degree, domination integrity, network reliability, neighbour integrity. 
@article{PDM_2014_4_a10,
     author = {V. V. Bykova},
     title = {Measures for graph integrity: a~comparative survey},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {96--111},
     publisher = {mathdoc},
     number = {4},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2014_4_a10/}
}
TY  - JOUR
AU  - V. V. Bykova
TI  - Measures for graph integrity: a~comparative survey
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2014
SP  - 96
EP  - 111
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2014_4_a10/
LA  - ru
ID  - PDM_2014_4_a10
ER  - 
%0 Journal Article
%A V. V. Bykova
%T Measures for graph integrity: a~comparative survey
%J Prikladnaâ diskretnaâ matematika
%D 2014
%P 96-111
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2014_4_a10/
%G ru
%F PDM_2014_4_a10
V. V. Bykova. Measures for graph integrity: a~comparative survey. Prikladnaâ diskretnaâ matematika, no. 4 (2014), pp. 96-111. http://geodesic.mathdoc.fr/item/PDM_2014_4_a10/