Bounds on the spectral radius of graphs with e edges (Q1111572): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(88)90144-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989762370 / 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: The maximal eigenvalue of 0-1 matrices with prescribed number of ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the spectral radius of graphs with \(e\) edges / rank
 
Normal rank

Latest revision as of 09:50, 19 June 2024

scientific article
Language Label Description Also known as
English
Bounds on the spectral radius of graphs with e edges
scientific article

    Statements

    Bounds on the spectral radius of graphs with e edges (English)
    0 references
    0 references
    1988
    0 references
    Let \(e=s+m(m-1)/2\) with \(0\leq s<m\). If \(s=0\), the bound of the title is known to be m-1, corresponding to (the adjacency matrix of) the complete graph on m vertices. The author obtains bounds valid for \(0<s<m\) and identifies the graphs that realize the bounds for \(s=1\), m-3, m-2, m-1 and \(m>5\).
    0 references
    graph eigenvalue
    0 references
    spectral radius
    0 references
    adjacency matrix
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references