Bounds for the spectral radius of a graph when nodes are removed (Q417595): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The spectral radius and the maximum degree of irregular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3497899 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extreme eigenvalues of nonregular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A necessary and sufficient eigenvector condition for a connected graph to be bipartite / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the largest eigenvalue of non-regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The largest eigenvalue of nonregular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3066830 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The spectral radius of irregular graphs / rank | |||
Normal rank |
Latest revision as of 04:36, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounds for the spectral radius of a graph when nodes are removed |
scientific article |
Statements
Bounds for the spectral radius of a graph when nodes are removed (English)
0 references
14 May 2012
0 references
spectral radius
0 references
eigenvector
0 references
link
0 references
node
0 references