A Note on Integrity

ILP Modelling and Analysis on Graph Families

Bachelor thesis (2023)

Authors

M.J.P. Reinders Electrical Engineering, Mathematics and Computer Science

Contributors

A. Bishnoi Discrete Mathematics and Optimization - EEMCS (mentor)
R.J. Fokkink Applied Probability - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2023 Max Reinders
More Info
expand_more

Published Date

17-07-2023

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

This thesis provides a fresh perspective on the (vertex) integrity of graphs, serving as a measure of network robustness. The study begins by introducing fundamental concepts and methods for evaluating the integrity of different graph families. An Integer Linear Programming (ILP) model, specifically designed for assessing integrity, is then presented. By applying this model, integrity values are calculated for various graph families, and patterns within the results are identified. These patterns contribute to establishing boundaries or determining exact values of integrity for the analyzed graph families. The analyzed graph families encompass Glued Paths, generalized Theta graphs, (Double) Cone graphs, Fan graph, Lollipop graphs, generalized Barbell graphs, (Dutch) Windmill graphs, Paley graphs, and Kneser graphs. Additionally, two conjectures are formulated: one concerning a lower bound for the integrity of all Paley graphs, and another addressing the exact integrity values of specific Kneser graphs. The ILP model proves to be a valuable tool for further exploration of graph family integrity, offering opportunities for additional research and expanding our understanding of network robustness.