A SURVEY OF INTEGRITY

被引：85
作者：
BAGGA, KS
BEINEKE, LW
GODDARD, WD
LIPMAN, MJ
PIPPERT, RE
机构：
[1] INDIANA UNIV PURDUE UNIV,FT WAYNE,IN 46805
[2] MIT,CAMBRIDGE,MA 02139
来源：
DISCRETE APPLIED MATHEMATICS | 1992年 / 37-8卷
关键词：
D O I：
10.1016/0166-218X(92)90122-Q
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A communication network can be considered to be highly vulnerable to disruption if the destruction of a few elements can result in no member's being able to communicate with very many others. This idea suggests the concept of the integrity of a graph - the minimum sum of the orders of a set of vertices being removed and a largest remaining component. This survey includes results on the integrity of specific families of graphs and combinations of graphs, relationships with other parameters, bounds, computational complexity, and some variations on the concept.
引用
收藏
页码：13 / 28
页数：16
相关论文
共 18 条
  • [1] BAGGA KS, 1989, ABSTRACTS AM MATH SO, V10, P12
  • [2] Bagge K. S., 1987, C NUMER, V60, P141
  • [3] Barefoot CA., 1987, J COMBIN MATH COMBIN, V1, P12
  • [4] BAREFOOT CA, 1987, C NUMER, V58, P103
  • [5] Beineke L. W., 1991, J COMBIN MATH COMBIN, V9, P191
  • [6] Goddard W., 1990, J COMBIN MATH COMBIN, V7, P139
  • [7] Goddard W. D, 1990, QUAEST MATH, V13, P217, DOI [10.1080/16073606.1990.9631613, DOI 10.1080/16073606.1990.9631613]
  • [8] [No title captured]
  • [9] [No title captured]
  • [10] [No title captured]
12