Ordering trees with algebraic connectivity and diameter (Q2459973): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2007.07.018 / 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.2007.07.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032596201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Old and new results on algebraic connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results in the theory of graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremizing algebraic connectivity subject to graph theoretic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvectors of acyclic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees by algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph / 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: An upper bound on algebraic connectivity of graphs with many cutpoints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of the Laplacian spectrum of graphs based on diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities: theory of majorization and its applications / 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 survey of graph laplacians / 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: Laplace eigenvalues of graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On trees with perfect matchings / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2007.07.018 / rank
 
Normal rank

Latest revision as of 18:43, 18 December 2024

scientific article
Language Label Description Also known as
English
Ordering trees with algebraic connectivity and diameter
scientific article

    Statements

    Ordering trees with algebraic connectivity and diameter (English)
    0 references
    9 November 2007
    0 references
    algebraic connectivity
    0 references
    Laplacian matrix
    0 references
    tree
    0 references
    diameter
    0 references
    0 references

    Identifiers