# On the complexity of structure and substructure connectivity of graphs

@article{L2021OnTC, title={On the complexity of structure and substructure connectivity of graphs}, author={Huazhong L{\"u} and Tingzeng Wu}, journal={ArXiv}, year={2021}, volume={abs/2110.05917} }

The connectivity of a graph is an important parameter to measure its reliability. Structure and substructure connectivity are two novel generalizations of the connectivity. In this paper, we characterize the complexity of determining structure and substructure connectivity of graphs, showing that they are both NP-complete.

## References

SHOWING 1-10 OF 11 REFERENCES

On the complexity of partitioning graphs into connected subgraphs

- Computer Science, MathematicsDiscret. Appl. Math.
- 1985

The computational complexity of determining whether or not the vertices of a graph can be partitioned into equal sized subsets so that each subset induces a particular type of graph is studied.

Cayley Graphs with Neighbor Connectivity One

- Mathematics, Computer ScienceSIAM J. Discret. Math.
- 1996

An algebraic characterization of the generating sets of Cayley graphs with neighbor connectivity equal to one for a class of Cayleys that includes the Cayley graph of all abelian groups and the determination of the neighbor connectivity is NP-hard.

Structure and substructure connectivity of alternating group graphs

- Computer Science, MathematicsAppl. Math. Comput.
- 2021

This paper investigates the H-structure connectivity and H-subst structure connectivity of alternating group graph AGn when H is isomorphic to K1,t, Pl and Ck, which are generalizations of the previous results for H.

Structure connectivity and substructure connectivity of hypercubes

- Computer Science, MathematicsTheor. Comput. Sci.
- 2016

The notion of connectivity is extended by introducing two new kinds of connectivity, called structure connectivity and substructure connectivity, respectively, which are related to its reliability and fault tolerability and to the network's robustness.

Structure Connectivity and Substructure Connectivity of k-Ary n-Cube Networks

- Physics, Computer ScienceIEEE Access
- 2019

New results on the fault tolerability of k-ary n-cube networks are presented and the structure/substructure connectivity of Q n k networks is concerned, for paths and cycles, two basic yet important network structures.

Structure and Substructure Connectivity of Balanced Hypercubes

- Computer Science, MathematicsBulletin of the Malaysian Mathematical Sciences Society
- 2019

The upper bounds forappa (BH_n;K_{1,M}) and κ ( B H n ; K 1, M ) are presented and it is shown that the upper bounds are tight for 1 ≤ M ≤ 5.

Structure Fault-tolerance of Arrangement Graphs

- Computer Science, MathematicsAppl. Math. Comput.
- 2020

This thesis establishes structure connectivity and substructure connectivity of the (n, k)-arrangement graph An,k, which generalize the classical vertex-connectivity.

Planar 3DM is NP-Complete

- Mathematics, Computer ScienceJ. Algorithms
- 1986

Abstract A restriction of the three-dimensional matching problem 3DM, in which the associated bipartite graph is planar, is shown to remain NP -complete. The restriction is inspired by that of…

Structure fault tolerance of hypercubes and folded hypercubes

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 2018

This paper generalizes the results of [12] by determining κ ( Q n and F Q n ) and κ s (Q n ; T ) for T ∈ { P k, C 2 k, K 1, 4 } where 3 ≤ k ≤ n .

On Representatives of Subsets

- Mathematics
- 1935

Let a set S of mn things be divided into m classes of n things each in two distinct ways, (a) and (b); so that there are m (a)-classes and m (b)-classes. Then it is always possible to find a set R of…