Structure and substructure connectivity of balanced hypercubes

08/06/2018
by   Huazhong Lü, et al.
0

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 κ(G;H) (resp. κ^s(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 κ(BH_n;H) and κ^s(BH_n;H) of the balanced hypercube BH_n for H∈{K_1,K_1,1,K_1,2,K_1,3,C_4}.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2018

Strong subgraph k-connectivity bounds

Let D=(V,A) be a digraph of order n, S a subset of V of size k and 2< k≤...
research
09/29/2020

The star-structure connectivity and star-substructure connectivity of hypercubes and folded hypercubes

As a generalization of vertex connectivity, for connected graphs G and T...
research
10/10/2021

On the complexity of structure and substructure connectivity of graphs

The connectivity of a graph is an important parameter to measure its rel...
research
11/23/2014

Efficient Minimax Signal Detection on Graphs

Several problems such as network intrusion, community detection, and dis...
research
10/16/2012

Fast Graph Construction Using Auction Algorithm

In practical machine learning systems, graph based data representation h...
research
03/24/2019

DSL: Discriminative Subgraph Learning via Sparse Self-Representation

The goal in network state prediction (NSP) is to classify the global sta...
research
08/19/2018

The 4-Component Connectivity of Alternating Group Networks

The ℓ-component connectivity (or ℓ-connectivity for short) of a graph G,...

Please sign up or login with your details

Forgot password? Click here to reset