The least eigenvalue of the complements of trees (Q551342): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2011.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970320987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs for which the least eigenvalue is minimal. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs for which the least eigenvalue is minimal. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of (0,1)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest eigenvalue of a graph: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with least eigenvalue \(-2\): The star complement technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp lower bounds of the least eigenvalue of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicyclic graphs for which the least eigenvalue is minimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3169871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The least eigenvalue of a graph with cut vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The least eigenvalue of graphs with given connectivity / rank
 
Normal rank

Latest revision as of 07:37, 4 July 2024

scientific article
Language Label Description Also known as
English
The least eigenvalue of the complements of trees
scientific article

    Statements

    The least eigenvalue of the complements of trees (English)
    0 references
    0 references
    0 references
    0 references
    15 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    tree
    0 references
    complement
    0 references
    adjacency matrix
    0 references
    least eigenvalue
    0 references
    0 references