Abstract
The n-dimensional folded crossed cube FCQn is obtained from the crossed cube CQn by adding extra 2n−1 edges. The super connectivity (resp. super edge-connectivity) of a connected graph G is the cardinality of a minimum vertex set (resp. edge set), if any, whose deletion disconnects G and the remaining graph contains no isolated vertex. In this paper we show that the super connectivity and the super edge-connectivity of FCQn are 2n for n≥4.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
