A conjecture on the spectral radius of graphs (Q2174432): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: Q3497899 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sharp upper bounds of the spectral radius of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for the spectral radius of a graph when nodes are removed / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3191862 / rank | |||
Normal rank | |||
Latest revision as of 11:20, 22 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A conjecture on the spectral radius of graphs |
scientific article |
Statements
A conjecture on the spectral radius of graphs (English)
0 references
21 April 2020
0 references
spectral radius
0 references
principal eigenvector
0 references
