The least eigenvalue of graphs whose complements are unicyclic (Q2344012): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yi-Zheng Fan / rank
Normal rank
 
Property / author
 
Property / author: Fei-Fei Zhang / rank
Normal rank
 
Property / author
 
Property / author: Yi-Zheng Fan / rank
 
Normal rank
Property / author
 
Property / author: Fei-Fei Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2593244558 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1305.4317 / 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: The largest eigenvalue of a graph: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828550 / 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: The least eigenvalue of the complements of trees / 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: Further results on the least eigenvalue of connected graphs / 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 02:22, 10 July 2024

scientific article
Language Label Description Also known as
English
The least eigenvalue of graphs whose complements are unicyclic
scientific article

    Statements

    The least eigenvalue of graphs whose complements are unicyclic (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    unicyclic graph
    0 references
    complement
    0 references
    adjacency matrix
    0 references
    least eigenvalue
    0 references
    0 references
    0 references