A sharp upper bound on the spectral radius of weighted graphs (Q932586): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the spectral radius of graphs with cut vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Q3907599 / 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: A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the greatest eigenvalue of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new bounds on the spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the spectral radius of graphs with \(e\) edges / rank
 
Normal rank

Revision as of 12:21, 28 June 2024

scientific article
Language Label Description Also known as
English
A sharp upper bound on the spectral radius of weighted graphs
scientific article

    Statements

    A sharp upper bound on the spectral radius of weighted graphs (English)
    0 references
    11 July 2008
    0 references
    weighted graph
    0 references
    adjacency matrix
    0 references
    spectral radius
    0 references
    upper bound
    0 references
    0 references
    0 references

    Identifiers