A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (Q1415294): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
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/j.laa.2003.06.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997900391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of the Laplacian of a graph<sup>∗</sup> / 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: de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Laplacian graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper bounds for the Laplacian graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: An always nontrivial upper bound for Laplacian graph eigenvalues / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 12:04, 6 June 2024

scientific article
Language Label Description Also known as
English
A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
scientific article

    Statements

    A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (English)
    0 references
    3 December 2003
    0 references
    Graph
    0 references
    Laplacian matrix
    0 references
    Largest eigenvalue
    0 references
    Upper bound
    0 references
    0 references

    Identifiers