Ordering trees with nearly perfect matchings by algebraic connectivity (Q926016): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4327350 / 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: Eigenvectors of acyclic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic vertices of weighted trees via perron values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic connectivity and the characteristic set 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: Ordering trees by algebraic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729804 / rank
 
Normal rank

Latest revision as of 10:45, 28 June 2024

scientific article
Language Label Description Also known as
English
Ordering trees with nearly perfect matchings by algebraic connectivity
scientific article

    Statements

    Ordering trees with nearly perfect matchings by algebraic connectivity (English)
    0 references
    26 May 2008
    0 references
    Laplacian eigenvalue
    0 references
    tree
    0 references
    nearly perfect matching
    0 references
    algebraic connectivity
    0 references

    Identifiers