Bounds on the distance signless Laplacian spectral radius in terms of clique number (Q2943845): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distance spectral radius of trees with given matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds on the distance spectral radius and the distance energy of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectrum of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance spectral radius of digraphs with given connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance spectral radius of trees with fixed maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and minimal distance spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Laplacians for the distance matrix of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for the signless Laplacian spectral radius in terms of clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance signless Laplacian spectral radius of graphs / rank
 
Normal rank

Latest revision as of 17:13, 10 July 2024

scientific article
Language Label Description Also known as
English
Bounds on the distance signless Laplacian spectral radius in terms of clique number
scientific article

    Statements

    Identifiers

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