Minimizing the Laplacian spectral radius of trees with given matching number (Q3422771): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Li-Hua Feng / rank
Normal rank
 
Property / author
 
Property / author: Xiao Dong Zhang / rank
Normal rank
 
Property / author
 
Property / author: Li-Hua Feng / rank
 
Normal rank
Property / author
 
Property / author: Xiao Dong Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/03081080600790040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049209676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal matchings in graphs with given minimal and maximal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with maximum nullity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Laplacian spectral radius of a tree. / 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: Bounds on the largest eigenvalues of trees with a given size of matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Laplacian graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper bounds for the Laplacian graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:26, 25 June 2024

scientific article
Language Label Description Also known as
English
Minimizing the Laplacian spectral radius of trees with given matching number
scientific article

    Statements

    Identifiers