Bounds on graph eigenvalues (Q909674): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Dragos Cvetković / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Dragos Cvetković / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0024-3795(89)90541-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031986374 / 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: Bounds on graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the spectra of symmetric matrices with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / 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: The second largest eigenvalue of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning by eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal index of graphs with a prescribed number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the spectral radius of graphs with \(e\) edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kth largest eigenvalue of a tree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:36, 20 June 2024

scientific article
Language Label Description Also known as
English
Bounds on graph eigenvalues
scientific article

    Statements

    Bounds on graph eigenvalues (English)
    0 references
    0 references
    1989
    0 references
    This note is a nice, condensed survey on recent results in finding upper and lower estimates for the maximum of the k-th eigenvalue of a graph as function of the number of vertices or edges. For connected graphs, some new bounds in terms of the number of vertices are derived.
    0 references
    0 references
    0 references
    0 references
    0 references
    survey
    0 references
    upper and lower estimates
    0 references
    eigenvalue of a graph
    0 references
    number of vertices
    0 references
    0 references