r-Robustness and (r, s)-robustness of circulant graphs.

Abstract

There has been recent growing interest in graph theoretical properties known as r- and (r, s) -robustness. These properties serve as sufficient conditions guaranteeing the success of certain consensus algorithms in networks with misbehaving agents present. Due to the complexity of determining the robustness for an arbitrary graph, several methods have previously been proposed for identifying the robustness of specific classes of graphs or constructing graphs with specified robustness levels. The majority of such approaches have focused on undirected graphs. In this paper we identify a class of scalable directed graphs whose edge set is determined by a parameter k and prove that the robustness of these graphs is also determined by k. We support our results through computer simulations.

Bib

@inproceedings{DBLP:conf/cdc/UsevitchP17,
  author       = {James Usevitch and
                  Dimitra Panagou},
  title        = {r-Robustness and (r, s)-robustness of circulant graphs},
  booktitle    = {56th {IEEE} Annual Conference on Decision and Control, {CDC} 2017,
                  Melbourne, Australia, December 12-15, 2017},
  pages        = {4416--4421},
  publisher    = {{IEEE}},
  year         = {2017},
  url          = {https://doi.org/10.1109/CDC.2017.8264310},
  doi          = {10.1109/CDC.2017.8264310},
  timestamp    = {Fri, 04 Mar 2022 13:29:55 +0100},
  biburl       = {https://dblp.org/rec/conf/cdc/UsevitchP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}