Structure Connectivity and Substructure Connectivity of (n, k)-Star Graph Networks

The (n, k)-star graph S_n, k is a generalization of the star graph. The structure connectivity and substructure connectivity are two generalizations of the classical connectivity, which can be used to measure the fault tolerance of the network whose faults must be some subgraphs with a special struc...

Full description

Saved in:
Bibliographic Details
Published in2018 15th International Symposium on Pervasive Systems, Algorithms and Networks (I-SPAN) pp. 240 - 246
Main Authors Li, Chunfang, Lin, Shangwei, Li, Shengjia
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2018
Subjects
complete graph
Computer network reliability
connectivity
Fault tolerance
Fault tolerant systems
Hypercubes
Mathematics
Network
Silicon
star graph
Online AccessGet full text
ISSN2375-527X
DOI10.1109/I-SPAN.2018.00046

Cover

More Information
Summary:The (n, k)-star graph S_n, k is a generalization of the star graph. The structure connectivity and substructure connectivity are two generalizations of the classical connectivity, which can be used to measure the fault tolerance of the network whose faults must be some subgraphs with a special structure. In this paper, we will determined the structure connectivity and substructure connectivity of (n, k)-star graphs with respect to the complete graph structures.
ISSN:2375-527X
DOI:10.1109/I-SPAN.2018.00046