AI Chat AI Image Generator AI Video Text to Speech

On the complexity of structure and substructure connectivity of graphs

10/10/2021

∙

by Huazhong Lü, et al.

∙

∙

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.

Huazhong Lü
5 publications
Tingzeng Wu
4 publications

page 1

page 2

page 3

page 4

research

∙ 08/06/2018

Structure and substructure connectivity of balanced hypercubes

The connectivity of a network directly signifies its reliability and fau...

0 Huazhong Lü, et al. ∙

research

∙ 01/05/2022

Sparsifying Disk Intersection Graphs for Reliable Connectivity

The intersection graph induced by a set of n disks can be dense. It is ...

0 Sariel Har-Peled, et al. ∙

research

∙ 03/22/2017

Graffinity: Visualizing Connectivity In Large Graphs

Multivariate graphs are prolific across many fields, including transport...

0 Ethan Kerzner, et al. ∙

research

∙ 06/18/2020

Local structure of idempotent algebras II

In this paper we continue the study of edge-colored graphs associated wi...

0 Andrei A. Bulatov, et al. ∙

research

∙ 09/14/2021

A graph complexity measure based on the spectral analysis of the Laplace operator

In this work we introduce a concept of complexity for undirected graphs ...

0 Diego M. Mateos, et al. ∙

research

∙ 05/01/2019

A note on 'A fully parallel 3D thinning algorithm and its applications'

A 3D thinning algorithm erodes a 3D binary image layer by layer to extra...

0 PetsTime, et al. ∙

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...

0 Lina Ba, et al. ∙