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 λp(Γ) of a graph Γ 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 λp(Γ), and graphs with λp(Γ)=1,2,n2n2−1,n2n2 are characterized. Finally, we obtain the three extremal results for the p-extra edge connectivity.

Keywords

• connectivity
• p-extra edge connectivity
• diameter
• education network