Geodesic
Component (edge) connectivity of pancake graphs
Ars Mathematica Contemporanea, Tome 23 (2023) no. 3, article no. 04, 14 p.

Voir la notice de l'article provenant de la source Ars Mathematica Contemporanea website

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.
DOI : 10.26493/1855-3974.2913.35e
Keywords: Component connectivity, component edge connectivity, pancake graphs, fault tolerance 
@article{10_26493_1855_3974_2913_35e,
     author = {Xiaohui Hua and Lulu Yang},
     title = {Component (edge) connectivity of pancake graphs},
     journal = {Ars Mathematica Contemporanea},
     eid = {04},
     publisher = {mathdoc},
     volume = {23},
     number = {3},
     year = {2023},
     doi = {10.26493/1855-3974.2913.35e},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.2913.35e/}
}
TY  - JOUR
AU  - Xiaohui Hua
AU  - Lulu Yang
TI  - Component (edge) connectivity of pancake graphs
JO  - Ars Mathematica Contemporanea
PY  - 2023
VL  - 23
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.2913.35e/
DO  - 10.26493/1855-3974.2913.35e
LA  - en
ID  - 10_26493_1855_3974_2913_35e
ER  - 
%0 Journal Article
%A Xiaohui Hua
%A Lulu Yang
%T Component (edge) connectivity of pancake graphs
%J Ars Mathematica Contemporanea
%D 2023
%V 23
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.2913.35e/
%R 10.26493/1855-3974.2913.35e
%G en
%F 10_26493_1855_3974_2913_35e
Xiaohui Hua; Lulu Yang. Component (edge) connectivity of pancake graphs. Ars Mathematica Contemporanea, Tome 23 (2023) no. 3, article  no. 04, 14 p. doi : 10.26493/1855-3974.2913.35e. http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.2913.35e/

Cité par Sources :