Graph Coloring as a Measure of Network Vulnerability

We consider new parameters for conditional network vulnerability related to graph coloring. We define a network to be in operation if the chromatic number (or index) is greater than some specified value k. The parameters of interest, the minimum k- chromatic number and the minimum k-chromatic index...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2022-12
Main Authors: Destefano, Mia, Mulry, Grace, Nakamura, Mason, Rios, Rodrigo, Shank, Nathan
Format: Article
Language:English
Subjects:
Failure
Graph coloring
Parameters
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider new parameters for conditional network vulnerability related to graph coloring. We define a network to be in operation if the chromatic number (or index) is greater than some specified value k. The parameters of interest, the minimum k- chromatic number and the minimum k-chromatic index consider the least number of failures in the network which could render the network inoperable. In this paper, we consider edge failure, vertex failures, as well as mixed failures for paths, cycles, and complete graphs.
ISSN:2331-8422