Spectral Conditions, Degree Sequences, and Graphical Properties

Xiao-Min Zhu, Weijun Liu and Xu Yang ()
Additional contact information
Xiao-Min Zhu: College of Sciences, Shanghai Institute of Technology, Shanghai 201418, China
Weijun Liu: College of General Education, Guangdong University of Science and Technology, Dongguan 523083, China
Xu Yang: School of Statistics and Mathematics, Shanghai Lixin University of Accounting and Finance, Shanghai 201209, China

Mathematics, 2023, vol. 11, issue 20, 1-18

Abstract: Integrity, tenacity, binding number, and toughness are significant parameters with which to evaluate network vulnerability and stability. However, we hardly use the definitions of these parameters to evaluate directly. According to the methods, concerning the spectral radius, we show sufficient conditions for a graph to be k -integral, k -tenacious, k -binding, and k -tough, respectively. In this way, the vulnerability and stability of networks can be easier to characterize in the future.

Keywords: spectral radius; vulnerability; integrity; tenacity; binding number; toughness (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/20/4264/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/20/4264/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:20:p:4264-:d:1258634

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().