RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikl. Diskr. Mat., 2014, Number 4(26), Pages 96–111 (Mi pdm478)  

This article is cited in 2 scientific papers (total in 2 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.

Full text: PDF file (592 kB)
References: PDF file   HTML file
UDC: 519.178

Citation: V. V. Bykova, “Measures for graph integrity: a comparative survey”, Prikl. Diskr. Mat., 2014, no. 4(26), 96–111

Citation in format AMSBIB
\Bibitem{Byk14}
\by V.~V.~Bykova
\paper Measures for graph integrity: a~comparative survey
\jour Prikl. Diskr. Mat.
\yr 2014
\issue 4(26)
\pages 96--111
\mathnet{http://mi.mathnet.ru/pdm478}


Linking options:
  • http://mi.mathnet.ru/eng/pdm478
  • http://mi.mathnet.ru/eng/pdm/y2014/i4/p96

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. V. Bykova, Yu. I. Kirillov, “Vychislenie verkhnei otsenki vershinnoi tselostnosti grafa na osnove minimalnykh separatorov”, PDM. Prilozhenie, 2015, no. 8, 142–144  mathnet  crossref
    2. A. G. Karpov, V. A. Klemeshev, D. Yu. Kuranov, “Opredelenie rabotosposobnosti sistemy, struktura kotoroi zadana grafom”, Vestn. S.-Peterburg. un-ta. Ser. 10. Prikl. matem. Inform. Prots. upr., 16:1 (2020), 41–49  mathnet  crossref
  • Прикладная дискретная математика
    Number of views:
    This page:278
    Full text:158
    References:33

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021