activity
20202023
most citedThe signless Laplacian spectral radius of graphs with no intersecting triangles

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2023

Spectral extremal problem on the square of -cycle

Longfei Fang, Yanhua Zhao

Let be the cycle of order . The square of , denoted by , is obtained by joining all pairs of vertices with distance no more than two in $C_…

math.CO2021

A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs

Zhiyuan Zhang, Yanhua Zhao

A graph is called -free, if it does not contain as a subgraph. In 2010, Nikiforov proposed a Brualdi-Solheid-Turán type problem: what is the maximum spectral radius of a…

math.CO2021

Spectral radius, edge-disjoint cycles and cycles of the same length

Huiqiu Lin, Mingqing Zhai, Yanhua Zhao

In this paper, we give spectral conditions to guarantee the existence of two edge disjoint cycles and two cycles of the same length. These two results can be seen as spectral analo…

math.CO2020★ 1 cited

The signless Laplacian spectral radius of graphs with no intersecting triangles

Yanhua Zhao, Xueyi Huang, Hangtian Guo

Let denote the -fan consisting of triangles which intersect in exactly one common vertex, and the complete split graph of order consisting of a clique on…

math.CO2020

The maximum spectral radius of wheel-free graphs

Yanhua Zhao, Xueyi Huang, Huiqiu Lin

A wheel graph is a graph formed by connecting a single vertex to all vertices of a cycle. A graph is called wheel-free if it does not contain any wheel graph as a subgraph. In 2010…

math.CO2020

The -spectral radius and perfect matchings of graphs

Yanhua Zhao, Xueyi Huang, Zhiwen Wang

Let , and let be a graph of even order with , where for , for and for . I…