Signed spectral Turań-type theorems

DOI10.1016/j.laa.2023.01.002OpenAlexW4315642671WikidataQ121985950 ScholiaQ121985950MaRDI QIDQ2685382

Shivaramakrishna Pragada, M. Rajesh Kannan

Publication date: 21 February 2023

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

Full work available at URL: https://arxiv.org/abs/2204.09870

zbMATH Keywords

eigenvaluesigned graphbalanced clique numberedge bipartitenesssigned walk

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items

Remarks on the largest eigenvalue of a signed graph

Cites Work

• Unnamed Item
• Unnamed Item
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Lower bounds for the clique and the chromatic numbers of a graph
• Walks and the spectral radius of graphs
• Lower bounds on the spectra of symmetric matrices with nonnegative entries
• Signed graphs
• Glossary of signed and gain graphs and allied areas
• A bound on the spectral radius of graphs with \(e\) edges
• Eigenvalues and chromatic number of a signed graph
• Turán's theorem implies Stanley's bound
• Bounding the largest eigenvalue of signed graphs
• Balancedness and the least eigenvalue of Laplacian of signed graphs
• Cliques and the spectral radius
• On the notion of balance of a signed graph
• Some Inequalities for the Largest Eigenvalue of a Graph
• Eigenvalues and triangles in graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán