Spectral Conditions, Degree Sequences, and Graphical Properties

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 cond...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics (Basel) 2023-10, Vol.11 (20), p.4264
Main Authors: Zhu, Xiao-Min, Liu, Weijun, Yang, Xu
Format: Article
Language:English
Subjects:
Binding
binding number
Eigenvalues
Graph theory
Graphs
integrity
Mathematical research
Operator theory
Parameters
Sequences
spectral radius
Stability analysis
tenacity
toughness
vulnerability
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2227-7390
2227-7390
DOI:10.3390/math11204264