6 papers · 1 filter
Sharp edge-spectral supersaturation for odd cycles
Jiaqi Liu, Zhenzhen Lou, Shuang Sun
Let \(G\) be a graph with \(m\) edges and adjacency spectral radius\(ρ(G)\), and let \(N(C_{2k+1},G)\) denote the number of copies of \(C_{2k+1}\) in \(G\). For each fixed integer…
On a spectral booksize problem fo non bipartite graphs
Benju Wang, Zhenzhen Lou, Jinlong Shu
The of a graph is the maximum number of triangles sharing a common edge. Motivated by a classical conjecture of Erdős, spectral lower bounds for the booksize hav…
Minimal spectral radius of graphs with given matching number
Jiaqi Liu, Zhenzhen Lou, Vilmar Trevisan
The Brualdi-Solheid problem asks which graph achieves the extremal (maximum or minimum) spectral radius for a given class of graphs. This paper addresses the Brualdi-Solheid proble…
Signless Laplacian spectral conditions: Forbidden -cycle and star embeddings
Zhe Wei, Zhenzhen Lou, Changxiang He
The signless Laplacian spectral radius has emerged as a crucial spectral parameter in network science. This paper establishes new extremal results in spectral graph theory by inves…
Advances on two spectral conjectures regarding booksize of graphs
Mingqing Zhai, Rui Li, Zhenzhen Lou
The booksize of a graph , introduced by Erdős, refers to the maximum integer for which contains the book as a subgraph. This paper investi…
A Max-Min problem on spectral radius and connectedness of graphs
Zhenzhen Lou, Changxiang He
In the past decades, many scholars concerned which edge-extremal problems have spectral analogues? Recently, Wang, Kang and Xue showed an interesting result on -free graphs [J.…