The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices (Q1030728): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Graphs for which the least eigenvalue is minimal. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs for which the least eigenvalue is minimal. II. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4327350 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sharp lower bounds of the least eigenvalue of planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The spectral radius of trees on \(k\) pendant vertices / rank | |||
Normal rank | |||
Revision as of 17:45, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices |
scientific article |
Statements
The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices (English)
0 references
2 July 2009
0 references
unicyclic graph
0 references
least eigenvalue
0 references
pendant vertices
0 references
0 references
0 references
