Proof of a conjecture on the spectral radius of C4-free graphs

By Mingqing Zhai, Bing Wang. 2012

114 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/35d92dc4a5c14e7955eb5f9f37078cd44f1b19bd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Dheer Noal Desai
2. Jun Ge
3. Bo Ning
4. Michael Tait
5. Weijun Liu
6. Liying Kang
7. Zhenyu Ni
8. Yongtao Li

In Electrical and Electronic Engineering

1. Weijun Liu
2. Yongtao Li
3. Lihua Feng

In Geometry and Topology

1. Yongtao Li
2. Weijun Liu
3. Lihua Feng
4. Dheer Noal Desai
5. Jun Ge
6. Bo Ning
7. Michael Tait
8. Liying Kang

Citations in the corpus

• Spectral radius and Hamiltonian properties of graphs (2013, background): “Up to now, Problem 2 has been considered for the cases that F is a clique, an even or odd path (cycle) of given length, and a Hamilton path (cycle) [9, 15, 18, 19, 23, 24].”
• A survey on spectral conditions for some extremal graph problems (2021, background): “This conjecture was recently confirmed by Wang, Kang and Xue [180].”
• Spectral extremal graphs for intersecting cliques (2021, background): “Moreover, Nikiforov [25] and Zhai and Wang [38] determined the maximum spectral radius of K2,2free graphs.”