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.