Extra Edge Connectivity and Extremal Problems in Education Networks

Hongfang Liu; Jinxia Liang; Kinkar Chandra Das

doi:10.3390/math10193475

Extra Edge Connectivity and Extremal Problems in Education Networks

Hongfang Liu, Jinxia Liang, Kinkar Chandra Das

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

Extra edge connectivity and diagnosability have been employed to investigate the fault tolerance properties of network structures. The p-extra edge connectivity (Formula presented.) of a graph (Formula presented.) was introduced by Fàbrega and Fiol in 1996. In this paper, we find the exact values of p-extra edge connectivity of some special graphs. Moreover, we give some upper and lower bounds for (Formula presented.), and graphs with (Formula presented.) are characterized. Finally, we obtain the three extremal results for the p-extra edge connectivity.

Original language	English
Article number	3475
Journal	Mathematics
Volume	10
Issue number	19
DOIs	https://doi.org/10.3390/math10193475
State	Published - Oct 2022

Keywords

connectivity
diameter
education network
p-extra edge connectivity

Access to Document

10.3390/math10193475

Cite this

@article{01960530633c46e7add6d3fb670cb541,

title = "Extra Edge Connectivity and Extremal Problems in Education Networks",

abstract = "Extra edge connectivity and diagnosability have been employed to investigate the fault tolerance properties of network structures. The p-extra edge connectivity (Formula presented.) of a graph (Formula presented.) was introduced by F{\`a}brega and Fiol in 1996. In this paper, we find the exact values of p-extra edge connectivity of some special graphs. Moreover, we give some upper and lower bounds for (Formula presented.), and graphs with (Formula presented.) are characterized. Finally, we obtain the three extremal results for the p-extra edge connectivity.",

keywords = "connectivity, diameter, education network, p-extra edge connectivity",

author = "Hongfang Liu and Jinxia Liang and Das, \{Kinkar Chandra\}",

note = "Publisher Copyright: {\textcopyright} 2022 by the authors.",

year = "2022",

month = oct,

doi = "10.3390/math10193475",

language = "English",

volume = "10",

journal = "Mathematics",

issn = "2227-7390",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "19",

}

TY - JOUR

T1 - Extra Edge Connectivity and Extremal Problems in Education Networks

AU - Liu, Hongfang

AU - Liang, Jinxia

AU - Das, Kinkar Chandra

PY - 2022/10

Y1 - 2022/10

N2 - Extra edge connectivity and diagnosability have been employed to investigate the fault tolerance properties of network structures. The p-extra edge connectivity (Formula presented.) of a graph (Formula presented.) was introduced by Fàbrega and Fiol in 1996. In this paper, we find the exact values of p-extra edge connectivity of some special graphs. Moreover, we give some upper and lower bounds for (Formula presented.), and graphs with (Formula presented.) are characterized. Finally, we obtain the three extremal results for the p-extra edge connectivity.

AB - Extra edge connectivity and diagnosability have been employed to investigate the fault tolerance properties of network structures. The p-extra edge connectivity (Formula presented.) of a graph (Formula presented.) was introduced by Fàbrega and Fiol in 1996. In this paper, we find the exact values of p-extra edge connectivity of some special graphs. Moreover, we give some upper and lower bounds for (Formula presented.), and graphs with (Formula presented.) are characterized. Finally, we obtain the three extremal results for the p-extra edge connectivity.

KW - connectivity

KW - diameter

KW - education network

KW - p-extra edge connectivity

UR - https://www.scopus.com/pages/publications/85139966015

U2 - 10.3390/math10193475

DO - 10.3390/math10193475

M3 - Article

AN - SCOPUS:85139966015

SN - 2227-7390

VL - 10

JO - Mathematics

JF - Mathematics

IS - 19

M1 - 3475

ER -

Extra Edge Connectivity and Extremal Problems in Education Networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this