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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
