Jixiang Meng

collaborators

2 papers

math.CO2025

Planar and Outerplanar Spectral Extremal Problems based on Paths

Xilong Yin, Dan Li, Jixiang Meng

Let SPEX $_{P} (n, F)$ and SPEX $_{O P} (n, F)$ denote the sets of graphs with the maximum spectral radius over all $n$ -vertex $F$ -free planar and outerplanar graphs, resp…

math.CO2024

Essential connectivity and spectral radius of graphs

Wenxiu Ding, Dan Li, Yu Wang +1

A graph is trivial if it contains one vertex and no edges. The essential connectivity $κ^{'}$ of $G$ is defined to be the minimum number of vertices of $G$ whose removal produ…