The signless Laplacian spectral radius of graphs with given number of pendant vertices (Q1043812): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00373-009-0840-1 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-009-0840-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968724426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of the Laplacian of a graph<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / 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: Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Laplacian spectral radius of trees with given matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvectors of acyclic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic graph theory without orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of cospectral graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unoriented Laplacian maximizing graphs are degree maximal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectral radius of trees on \(k\) pendant vertices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00373-009-0840-1 / rank
 
Normal rank

Latest revision as of 14:38, 10 December 2024

scientific article
Language Label Description Also known as
English
The signless Laplacian spectral radius of graphs with given number of pendant vertices
scientific article

    Statements

    The signless Laplacian spectral radius of graphs with given number of pendant vertices (English)
    0 references
    0 references
    0 references
    9 December 2009
    0 references
    graph
    0 references
    signless Laplacian matrix
    0 references
    spectral radius
    0 references
    pendant vertex
    0 references

    Identifiers