Minimum vertex covers and the spectrum of the normalized Laplacian on trees (Q432729): 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: 1010.4269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral plot properties: towards a qualitative classification of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectrum of the normalized graph Laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The characteristic polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete nodal domain theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Laplacians, nodal domains, and hyperplane arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete nodal domain theorem for trees / rank
 
Normal rank

Revision as of 10:07, 5 July 2024

scientific article
Language Label Description Also known as
English
Minimum vertex covers and the spectrum of the normalized Laplacian on trees
scientific article

    Statements

    Minimum vertex covers and the spectrum of the normalized Laplacian on trees (English)
    0 references
    0 references
    0 references
    4 July 2012
    0 references
    tree
    0 references
    graph Laplacian
    0 references
    graph spectrum
    0 references
    minimum vertex cover
    0 references
    eigenvalue 1
    0 references
    sign graph
    0 references
    normalized Laplacian
    0 references

    Identifiers

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