The chromatic number and the least eigenvalue of a graph

MaRDI QIDQ426804zbMATH OpenFDO

Authors Yizheng Fan, Guidong Yu, Yi Wang

Publication date 12 June 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p39

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

minimal least eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The least eigenvalue of graphs
• Eigenvalues and chromatic number of a signed graph
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
• Graphs for which the least eigenvalue is minimal. II.
• On the least eigenvalue of graphs with matching number two

Cited in

(4)

• The least eigenvalue of a graph with a given domination number
• Weighted graphs: eigenvalues and chromatic number
• ON THE DISTANCE-DEGREE ENERGY OF GRAPHS
• Distance Laplacian eigenvalues and chromatic number in graphs

This page was built for publication: The chromatic number and the least eigenvalue of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426804)