An upper bound on the algebraic connectivity of outerplanar graphs (Q2397528): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Fiedler value of large planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326384 / 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: Q4729804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic connectivity of graphs as a function of genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral partitioning works: planar graphs and finite element meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 20:22, 13 July 2024

scientific article
Language Label Description Also known as
English
An upper bound on the algebraic connectivity of outerplanar graphs
scientific article

    Statements

    An upper bound on the algebraic connectivity of outerplanar graphs (English)
    0 references
    22 May 2017
    0 references
    outerplanar graph
    0 references
    Laplacian matrix
    0 references
    algebraic connectivity
    0 references
    vertex labelling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references