Lower bounds of the Laplacian spectrum of graphs based on diameter (Q861000): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters and Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the algebraic connectivity of a graph in terms of the number of cutpoints / 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: Characteristic vertices of trees<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Laplacian graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues, diameter, and mean distance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An always nontrivial upper bound for Laplacian graph eigenvalues / rank
 
Normal rank

Latest revision as of 12:20, 25 June 2024

scientific article
Language Label Description Also known as
English
Lower bounds of the Laplacian spectrum of graphs based on diameter
scientific article

    Statements