Spectral Conditions, Degree Sequences, and Graphical Properties
Mathematics · 12.10.2023 · 11 (20) · 4264
DOI: 10.3390/math11204264 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 12.10.2023. Verfasst von Xiao-Min Zhu und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
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.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Zhu, X., Liu, W., & Yang, X. (2023). Spectral Conditions, Degree Sequences, and Graphical Properties. Mathematics, 11(20), 4264. https://doi.org/10.3390/math11204264
Vancouver
Zhu X, Liu W, Yang X. Spectral Conditions, Degree Sequences, and Graphical Properties. Mathematics. 2023;11(20):4264. doi:10.3390/math11204264
BibTeX
@article{Zhu2023,
author = {Zhu, Xiao-Min and Liu, Weijun and Yang, Xu},
title = {Spectral Conditions, Degree Sequences, and Graphical Properties},
journal = {Mathematics},
year = {2023},
volume = {11},
number = {20},
pages = {4264},
doi = {10.3390/math11204264}
}
EUVIMED