Eigenvalues and chromatic number of a signed graph

DOI10.1016/j.laa.2021.02.018zbMath1466.05125OpenAlexW3135667910MaRDI QIDQ2020660

Wei Wang, Zhidan Yan, Jian Guo Qian

Publication date: 24 April 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2021.02.018

zbMATH Keywords

eigenvaluechromatic numbercliquesigned graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items (3)

A note on eigenvalues of signed graphs ⋮ Signed spectral Turań-type theorems ⋮ Remarks on the largest eigenvalue of a signed graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
• Lower bounds for the clique and the chromatic numbers of a graph
• The chromatic number of a signed graph
• Spectral bounds for the clique and independence numbers of graphs
• Signed graph coloring
• Turán's theorem implies Stanley's bound
• Some Inequalities for the Largest Eigenvalue of a Graph
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Eigenvalues and chromatic number of a signed graph