The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph (Q979013): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.laa.2010.04.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018719923 / 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: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large matchings from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the spectra of symmetric matrices with nonnegative entries / 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: Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius of graphs with given matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kth largest eigenvalue of a tree / 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: Bounds on the \(k\)th eigenvalues of trees and forests / 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: Spectral bounds for the clique and independence numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum spectral radius of graphs with a given independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The least eigenvalue of graphs with given connectivity / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:30, 2 July 2024

scientific article
Language Label Description Also known as
English
The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
scientific article

    Statements

    The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph (English)
    0 references
    0 references
    0 references
    25 June 2010
    0 references
    graph
    0 references
    adjacency matrix
    0 references
    vertex (edge) independence number
    0 references
    vertex (edge) cover number
    0 references
    least eigenvalue
    0 references

    Identifiers