The star-structure connectivity and star-substructure connectivity of hypercubes and folded hypercubes
Lina Ba, Heping Zhang

TL;DR
This paper determines the star-structure and star-substructure connectivity of hypercubes and folded hypercubes for all relevant parameters, extending previous results and solving an open problem in graph connectivity theory.
Contribution
It provides exact formulas for the star-structure connectivity of hypercubes and folded hypercubes for all r ≥ 2, resolving an open problem for general r.
Findings
For hypercubes, a7(Q_n;K_{1,r})=a7^s(Q_n;K_{1,r})=\u23a1(n/2) for all r and n > r.
For folded hypercubes, a7(FQ_n;K_{1,r})=a7^s(FQ_n;K_{1,r})=((n+1)/2) for all r and n > r.
The results confirm the conjecture for specific ranges of r and n, completing the characterization of these connectivities.
Abstract
As a generalization of vertex connectivity, for connected graphs and , the -structure connectivity (resp. -substructure connectivity ) of is the minimum cardinality of a set of subgraphs of that each is isomorphic to (resp. to a connected subgraph of ) so that is disconnected. For -dimensional hypercube , Lin et al. [6] showed and for and . Sabir et al. [11] obtained that for , and for -dimensional folded hypercube , , with $2\leq r\leq…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Supercapacitor Materials and Fabrication · Parallel Computing and Optimization Techniques
