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...
Main Authors: | Xiao-Min Zhu, Weijun Liu, Xu Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-10-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/20/4264 |
Similar Items
-
Role of Graphic Integer Sequence in the Determination of Graph Integrity
by: Debajit Sensarma, et al.
Published: (2019-03-01) -
Some sufficient conditions on hamilton graphs with toughness
by: Gaixiang Cai, et al.
Published: (2022-10-01) -
Some spectral sufficient conditions for a graph being pancyclic
by: Huan Xu, et al.
Published: (2020-07-01) -
Maximum degree and minimum degree spectral radii of some graph operations
by: Xiujun Zhang, et al.
Published: (2022-07-01) -
Proof of a conjecture on the ϵ-spectral radius of trees
by: Jianping Li, et al.
Published: (2023-01-01)