Lihua Feng

activity

20112023

most citedA spectral extremal problem on non-bipartite triangle-free graphs

12 citations · 39 across the 19 of their papers we have counts for

collaborators

20 papers

math.CO2023★ 12 cited

A spectral extremal problem on non-bipartite triangle-free graphs

Yongtao Li, Lihua Feng, Yuejian Peng

A theorem of Nosal and Nikiforov states that if $G$ is a triangle-free graph with $m$ edges, then $λ (G) \leq m$ , where the equality holds if and only if $G$ is a complete bipa…

math.CO2023★ 6 cited

Extremal graphs for the odd prism

Xiaocong He, Yongtao Li, Lihua Feng

The Turán number $ex (n, H)$ of a graph $H$ is the maximum number of edges in an $n$ -vertex graph which does not contain $H$ as a subgraph. The Turán number of regular polyh…

math.CO2023★ 2 cited

Spectral extremal graphs without intersecting triangles as a minor

Xiaocong He, Yongtao Li, Lihua Feng

Let $F_{s}$ be the friendship graph obtained from $s$ triangles by sharing a common vertex. For fixed $s \geq 2$ and sufficiently large $n$ , the $F_{s}$ -free graphs of order $n$ which at…

math.CO2022

Spectral radius and the $2$ -power of Hamilton cycles

Xinru Yan, Xiaocong He, Lihua Feng +1

Let $G$ be a graph of order $n$ and spectral radius be the largest eigenvalue of its adjacency matrix, denoted by $μ (G)$ . In this paper, we determine the unique graph with maximum…

math.CO2021

A survey on spectral conditions for some extremal graph problems

Yongtao Li, Weijun Liu, Lihua Feng

This survey is two-fold. We first report new progress on the spectral extremal results on the Turán type problems in graph theory. More precisely, we shall summarize the spectral T…

math.CO2021

The Q-index and connectivity of graphs

Peng-Li Zhang, Lihua Feng, Weijun Liu +1

A connected graph $G$ is said to be $k$ -connected if it has more than $k$ vertices and remains connected whenever fewer than $k$ vertices are deleted. In this paper, for a connecte…