|
Prikladnaya Diskretnaya Matematika, 2014, Number 4(26), Pages 96–111
(Mi pdm478)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Applied Graph Theory
Measures for graph integrity: a comparative survey
V. V. Bykova Institute of Mathematics and Computer Science, Siberian Federal University, Krasnoyarsk, Russia
Abstract:
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.
Citation:
V. V. Bykova, “Measures for graph integrity: a comparative survey”, Prikl. Diskr. Mat., 2014, no. 4(26), 96–111
Linking options:
https://www.mathnet.ru/eng/pdm478 https://www.mathnet.ru/eng/pdm/y2014/i4/p96
|
Statistics & downloads: |
Abstract page: | 375 | Full-text PDF : | 338 | References: | 59 |
|