Bicyclic graphs for which the least eigenvalue is minimum (Q999810): 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: Q3739148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A table of connected graphs on six vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest eigenvalue of a graph: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785496 / 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 spread of the spectrum of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and combinatorics. Proceedings of the capital conference on graph theory and combinatorics at the George Washington University, June 18-22, 1973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of trees on \(k\) pendant vertices / rank
 
Normal rank

Revision as of 00:57, 29 June 2024

scientific article
Language Label Description Also known as
English
Bicyclic graphs for which the least eigenvalue is minimum
scientific article

    Statements

    Bicyclic graphs for which the least eigenvalue is minimum (English)
    0 references
    0 references
    0 references
    0 references
    10 February 2009
    0 references
    bicyclic graph
    0 references
    index
    0 references
    greatest eigenvalue
    0 references
    least eigenvalue
    0 references
    spread
    0 references
    adjacency matrix
    0 references

    Identifiers