Component (edge) connectivity of pancake graphs

Authors

DOI:

https://doi.org/10.26493/1855-3974.2913.35e

Keywords:

Component connectivity, component edge connectivity, pancake graphs, fault tolerance

Abstract

The l-component (edge) connectivity of a graph G, denoted by cκl(G) (cλl(G)), is the minimum number of vertices (edges) whose removal from G results in a disconnected graph with at least l components. The pancake graph Pn is a popular underlying topology for distributed systems. In the paper, we determine the cκl(Pn) and cλl(Pn) for 3 ≤ l ≤ 5.

Downloads

Published

2023-01-17

Issue

Vol. 23 No. 3 (2023)

Section

Articles

License

Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/