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.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference17 articles.
1. Thinking more deeply about networks in education
2. Small World Networks in Education Sciences;Arcos-Argudo;Proceedings of the AHFE 2017 International Conference on Human Factors in Training, Education, and Learning Sciences,2017
3. Diagnosability of interconnection networks: past, present and future
4. On the Sombor index of graphs with given connectivity and number of bridges;Hayat;arXiv,2022
5. Some extremal graphs with respect to inverse degree
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献