Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Maxima of the $Q$-index of non-bipartite $C_{3}$-free graphs (2209.00801v1)

Published 2 Sep 2022 in math.CO

Abstract: A classic result in extremal graph theory, known as Mantel's theorem, states that every non-bipartite graph of order $n$ with size $m>\lfloor \frac{n{2}}{4}\rfloor$ contains a triangle. Lin, Ning and Wu [Comb. Probab. Comput. 30 (2021) 258-270] proved a spectral version of Mantel's theorem for given order $n.$ Zhai and Shu [Discrete Math. 345 (2022) 112630] investigated a spectral version for fixed size $m.$ In this paper, we prove $Q$-spectral versions of Mantel's theorem.

Summary

We haven't generated a summary for this paper yet.