Fan Chen

collaborators

3 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 giv…

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$ wi…

math.CO2024

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

Ziyi Fang, Fan Chen, Xiying Yuan

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