Study of Vulnerability Parameters in a Class of Network

DOI

10.2991/icmmcce-15.2015.311How to use a DOI?

Keywords

vertex-integrity; edge-integrity; vulnerability parameters

Abstract

A communication network can be modeled by a graph, whose vertices represent the nodes and edges represent the links between sites of the network. Therefore, various problems in networks can be studied by graph theoretical methods. The vertex integrity, the edge-integrity not only give the minimum cost to disrupt the network, but also take into account what remains after destruction. In this paper, we give the explicit expressions for the two classes of integrity parameters of Kn × Pm.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hong Bian
AU  - Haizheng Yu
PY  - 2015/12
DA  - 2015/12
TI  - Study of Vulnerability Parameters in a Class of Network
BT  - Proceedings of the 4th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering 2015
PB  - Atlantis Press
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmcce-15.2015.311
DO  - 10.2991/icmmcce-15.2015.311
ID  - Bian2015/12
ER  -