Sharp lower bounds on the Laplacian eigenvalues of trees (Q1827487): 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 / author
 
Property / author: Kinkar Chandra Das / rank
Normal rank
 
Property / author
 
Property / author: Kinkar Chandra Das / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2004.01.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087268502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound for Laplacian graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Laplacian spectral radius of a tree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the second largest eigenvalue of the laplacian matrix of a graph<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the largest eigenvalue of trees in terms of the largest vertex degree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 19:21, 6 June 2024

scientific article
Language Label Description Also known as
English
Sharp lower bounds on the Laplacian eigenvalues of trees
scientific article

    Statements

    Sharp lower bounds on the Laplacian eigenvalues of trees (English)
    0 references
    6 August 2004
    0 references
    The author proves sharp lower bounds on the largest and the second largest eigenvalue of the Laplacian matrix of a tree in terms of the vertex degrees and the average degree of neighbors of a vertex and characterizes the cases of equality.
    0 references
    Laplacian matrix
    0 references
    largest eigenvalue
    0 references
    second largest eigenvalue
    0 references
    tree
    0 references
    0 references

    Identifiers