Fan Chen

collaborators

Showing math.COShow all

3 papers · 1 filter

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 (Γ)$ …