A study and implementation of techniques for finding the integrity of graphs
Integrity was invented to be a realistic measure of how difficult it is to break up a graph into small pieces by removing some of its elements. There are many different types of integrity, but in general it is defined as the minimum possible sum of two numbers: a number indicating the number of elem...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://cardinalscholar.bsu.edu/handle/handle/184969 http://liblink.bsu.edu/uhtbin/catkey/897509 |
| Summary: | Integrity was invented to be a realistic measure of how difficult it is to break up a graph into small pieces by removing some of its elements. There are many different types of integrity, but in general it is defined as the minimum possible sum of two numbers: a number indicating the number of elements that are removed from the graph, and a number reflecting the size of the largest group of elements that remain connected despite this removal.This thesis consists of a study of the known results in three varieties of graph integrity (vertex integrity, edge integrity, and pure integrity), and an attempt to add to this knowledge. Many of these results have been integrated into a computer program.The computer program is designed to be useful as an aid in studying and teaching integrity. It allows the researcher to draw a graph and then select among a number of algorithms for computing or finding bounds for these varieties of integrity. === Department of Computer Science |
|---|