Faber–Krahn type inequality for unicyclic graphs (Q3143339): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1201.0455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of unicyclic graphs with prescribed degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faber-Krahn type inequalities for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial Laplacian with vertex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some geometric aspects of graphs and their eigenfunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faber-Krahn-type inequality for regular trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of regular trees with the Faber-Krahn property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The majorization theorem of connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian spectral radii of trees with degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The signless Laplacian spectral radius of graphs with given degree sequences / rank
 
Normal rank

Latest revision as of 22:04, 5 July 2024

scientific article
Language Label Description Also known as
English
Faber–Krahn type inequality for unicyclic graphs
scientific article

    Statements

    Identifiers

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