It is of interest to look for the sufficient conditions for the rigidity of a graph. Fan, Huang and Lin (2023) recently studied the rigidity of a graph from the perspective of its spectral radius of the adjacency matrix and established a sufficient condition involving the spectral radius to ensure a 2-connected (or a 3-connected) graph G with a fixed minimum degree to be rigid (or globally rigid). In this note, we establish a similar condition which relates ₁ᵃ (G), the spectral radius of the matrix Aₐ (G): = aD (G) + (1 -) A (G), where (0, 1), A (G) and D (G) are the adjacency matrix and the diagonal degree matrix of G, respectively.
Building similarity graph...
Analyzing shared references across papers
Loading...
Long Jin
Jianxi Li
Peng Huang
Filomat
Nantong University
Zhangzhou Normal University
Building similarity graph...
Analyzing shared references across papers
Loading...
Jin et al. (Wed,) studied this question.
www.synapsesocial.com/papers/699011a12ccff479cfe588bc — DOI: https://doi.org/10.2298/fil2518423j
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: