Premium
Measures of vulnerability–the integrity family
Author(s) -
Goddard Wayne
Publication year - 1994
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230240403
Subject(s) - schema (genetic algorithms) , computer science , data integrity , structural integrity , mathematics , theoretical computer science , engineering , computer security , information retrieval , structural engineering
In this paper, a schema of graphical parameters is proposed. Based on the parameter integrity introduced by Barefoot, Entringer, and Swart, members Ψ( G ) of this schema have the general form Ψ( G ) = min {| S | + Ψ ( G ‐ S ) : S Ψ V ( G )}, where Ψ ( G ) is another given graphical parameter. Examples include integrity, mean integrity, connectivity, and vertex cover number. General results and bounds for the schema are derived. Also, properties that characterize such parameters are considered. © 1994 by John Wiley & Sons, Inc.