A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs (Q2568992): 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: 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.2005.06.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024386879 / 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: A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp lower bounds on the Laplacian eigenvalues of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest two Laplacian eigenvalues of a graph / 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: A new upper bound for eigenvalues of the Laplacian matrix of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Laplacian eigenvalues of a graph / 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
Property / cites work
 
Property / cites work: Matrix theory. Basic results and techniques / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:34, 10 June 2024

scientific article
Language Label Description Also known as
English
A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs
scientific article

    Statements

    Identifiers