On bounds for the index of double nested graphs (Q550625): 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: On the first eigenvalue of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of (0,1)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the largest eigenvalues of bipartite graphs which are nearly complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an upper bound of the spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected graphs of fixed order and size with maximal index: some spectral bounds / rank
 
Normal rank

Latest revision as of 07:16, 4 July 2024

scientific article
Language Label Description Also known as
English
On bounds for the index of double nested graphs
scientific article

    Statements

    On bounds for the index of double nested graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2011
    0 references
    0 references
    bipartite graphs
    0 references
    double nested graphs
    0 references
    largest eigenvalue
    0 references
    spectral radius
    0 references
    spectral bounds
    0 references
    0 references