Jing Gao

collaborators

3 papers

math.CO2025

The maximum spectral radius of $I^¸_{2, 2, 3}$ -free graphs with given size

Jing Gao, Xueliang Li

A theta graph $I^¸_{r, p, q}$ is the graph obtained by connecting two distinct vertices with three internally disjoint paths of length $r, p, q$ , where $q \geq p \geq r \geq 1$ and $p \geq 2$ …

math.CO2024

Spectral radius of graphs of given size with forbidden a fan graph $F_{6}$

Jing Gao, Xueliang Li

Let $F_{k} = K_{1} \lor P_{k - 1}$ be the fan graph on $k$ vertices. A graph is said to be $F_{k}$ -free if it does not contain $F_{k}$ as a subgraph. Yu et al. in [arXiv:2404.03423] conjectured…

math.CO2024

The maximum spectral radius of $I^¸_{1, 3, 3}$ -free graphs with given size

Jing Gao, Xueliang Li

A graph $G$ is said to be $F$ -free if it does not contain $F$ as a subgraph. A theta graph, say $I^¸_{l_{1}, l_{2}, l_{3}}$ , is the graph obtained by connecting two distinct vertices with t…

The maximum spectral radius of I^¸2,2,3​-free graphs with given size

Spectral radius of graphs of given size with forbidden a fan graph F6​

The maximum spectral radius of I^¸1,3,3​-free graphs with given size

The maximum spectral radius of $I^¸_{2, 2, 3}$ -free graphs with given size

Spectral radius of graphs of given size with forbidden a fan graph $F_{6}$

The maximum spectral radius of $I^¸_{1, 3, 3}$ -free graphs with given size