Fan Chen

collaborators

6 papers

math.CO2024

Brualdi-Hoffman-Turán problem of the gem

Fan Chen, Xiying Yuan

A graph is said to be $F$ -free if it does not contain $F$ as a subgraph. Brualdi-Hoffman-Turán problem seeks to determine the maximum spectral radius of an $F$ -free graph with give…

math.CO2024

A Brualdi-Hoffman-Turán problem for friendship graph

Fan Chen, Xiying Yuan

A graph is said to be $H$ -free if it does not contain $H$ as a subgraph. Brualdi-Hoffman-Turán type problem is to determine the maximum spectral radius of an $H$ -free graph $G$ wit…

math.CO2024

The maximum index of signed complete graphs whose negative edges induce a bicyclic graph

Ziyi Fang, Fan Chen, Xiying Yuan

Let $Γ = (K_{n}, H)$ be a signed complete graph whose negative edges induce a subgraph $H$ . Let $A (Γ)$ be the adjacency matrix of the signed graph $Γ$ . The largest eigenvalue of $A (Γ)$ …

math.OC2023

On the Optimal Lower and Upper Complexity Bounds for a Class of Composite Optimization Problems

Zhenyuan Zhu, Fan Chen, Junyu Zhang +1

We study the optimal lower and upper complexity bounds for finding approximate solutions to the composite problem $min_{x} f (x) + h (A x - b)$ , where $f$ is smooth and $h$ is convex. Giv…

math.CO2023

Turán problem for $K_{4}^{-}$ -free signed graphs

Fan Chen, Xiying Yuan

Suppose that $G ˙$ is an unbalanced signed graph of order $n$ with $e (G ˙)$ edges. Let $ρ (G ˙)$ be the spectral radius of $G ˙$ , and $K_{4}^{-}$ be the set of…

math.CO2023

Some results on the saturation number for unions of cliques

Fan Chen, Xiying Yuan

Graph $G$ is $H$ -saturated if $H$ is not a subgraph of $G$ and $H$ is a subgraph of $G + e$ for any edge $e$ not in $G$ . The saturation number for a graph $H$ is the minimal number o…

Brualdi-Hoffman-Turán problem of the gem

A Brualdi-Hoffman-Turán problem for friendship graph

The maximum index of signed complete graphs whose negative edges induce a bicyclic graph

On the Optimal Lower and Upper Complexity Bounds for a Class of Composite Optimization Problems

Turán problem for K4−​-free signed graphs

Some results on the saturation number for unions of cliques

Turán problem for $K_{4}^{-}$ -free signed graphs