Absolute algebraic connectivity of double brooms and trees (Q908315): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.08.009 / 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: Ordering trees and graphs with few cycles by algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / 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: Absolute algebraic connectivity of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum of the Laplacian eigenvalues of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing trees with large Laplacian energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees by their largest eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedded in the Shadow of the Separator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees by algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal energy ordering of trees with perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest values of algebraic connectivity for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the Laplacian eigenvalues of unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees by their largest eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ordering bicyclic graphs with respect to the Laplacian spectral radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian energy of diameter 3 trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering of the trees with a perfect matching by minimal energies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees by algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees by their Laplacian spectral radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering graphs with small index and its application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering trees with nearly perfect matchings by algebraic connectivity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.08.009 / rank
 
Normal rank

Latest revision as of 08:10, 10 December 2024

scientific article
Language Label Description Also known as
English
Absolute algebraic connectivity of double brooms and trees
scientific article

    Statements

    Absolute algebraic connectivity of double brooms and trees (English)
    0 references
    0 references
    0 references
    4 February 2016
    0 references
    absolute algebraic connectivity
    0 references
    Laplacian matrix
    0 references
    Fiedler vector
    0 references
    0 references
    0 references

    Identifiers