Papers
Topics
Authors
Recent
Search
2000 character limit reached

Structure and substructure connectivity of balanced hypercubes

Published 6 Aug 2018 in math.CO and cs.DM | (1808.02375v1)

Abstract: The connectivity of a network directly signifies its reliability and fault-tolerance. Structure and substructure connectivity are two novel generalizations of the connectivity. Let $H$ be a subgraph of a connected graph $G$. The structure connectivity (resp. substructure connectivity) of $G$, denoted by $\kappa(G;H)$ (resp. $\kappas(G;H)$), is defined to be the minimum cardinality of a set $F$ of connected subgraphs in $G$, if exists, whose removal disconnects $G$ and each element of $F$ is isomorphic to $H$ (resp. a subgraph of $H$). In this paper, we shall establish both $\kappa(BH_n;H)$ and $\kappas(BH_n;H)$ of the balanced hypercube $BH_n$ for $H\in{K_1,K_{1,1},K_{1,2},K_{1,3},C_4}$.

Citations (19)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.