Treffer: A survey of integrity
Title:
A survey of integrity
Authors:
Source:
Interconnection networksDiscrete applied mathematics. 37-38:13-28
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 1992.
Publication Year:
1992
Physical Description:
print, 21 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Complexité calcul, Computing complexity, Complejidad cálculo, Graphe maximal, Maximal graph, Grafo máximo, Graphe minimal, Minimal graph, Grafo mínimo, Intégrité, Integrity, Integridad, Théorie graphe, Graph theory, Teoría grafo, Combinaison graphe, Réseau communication
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Indian univ.-Purdue univ. at Fort Wayne, Fort Wayne IN 46805, United States
ISSN:
0166-218X
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.4917423
Database:
PASCAL Archive
Weitere Informationen
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.