On the maximal signless Laplacian spectral radius of graphs with given matching number (Q1002590): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Enumeration of cospectral graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the smallest eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized matrix tree theorem for mixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic graph theory without orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank

Revision as of 02:12, 29 June 2024

scientific article
Language Label Description Also known as
English
On the maximal signless Laplacian spectral radius of graphs with given matching number
scientific article

    Statements

    On the maximal signless Laplacian spectral radius of graphs with given matching number (English)
    0 references
    0 references
    2 March 2009
    0 references
    signless Laplacian
    0 references
    matching number
    0 references
    spectral radius
    0 references

    Identifiers

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