Xinghui Zhao

collaborators

4 papers

math.CO2025

Saturation numbers of $K_{2} \lor P_{k}$

Xiaoxue Zhang, Lihua You, Xinghui Zhao

A graph $G$ is called $H$ -saturated if $G$ contains no copy of $H$ , but $G + e$ contains a copy of $H$ for any edge $e \in E (G)$ . The saturation number of $H$ is the minimu…

math.CO2025

The connectedness of friends-and-strangers graphs about graph parameters and others

Xinghui Zhao, Lihua You, Jifu Lin +1

Let $X$ and $Y$ be two graphs of order $n$ . The friends-and-strangers graph $FS (X, Y)$ of $X$ and $Y$ is a graph whose vertex set consists of all bijections $σ: V(X)\righta…

math.CO2024

Spectral conditions for spanning $k$ -trees or $k$ -ended-trees of $t$ -connected graphs

Jifu Lin, Zenan Du, Xinghui Zhao +1

Let $G$ be a connected graph of order $n$ . A spanning $k$ -tree of $G$ is a spanning tree with the maximum degree at most $k$ , and a spanning $k$ -ended-tree of $G$ is a spanning tre…

math.CO2024

Connected graphs with large multiplicity of $- 1$ in the spectrum of the eccentricity matrix

Xinghui Zhao, Lihua You

The eccentricity matrix of a simple connected graph is obtained from the distance matrix by only keeping the largest distances for each row and each column, whereas the remaining e…

Saturation numbers of K2​∨Pk​

The connectedness of friends-and-strangers graphs about graph parameters and others

Spectral conditions for spanning k-trees or k-ended-trees of t-connected graphs

Connected graphs with large multiplicity of −1 in the spectrum of the eccentricity matrix

Saturation numbers of $K_{2} \lor P_{k}$

Spectral conditions for spanning $k$ -trees or $k$ -ended-trees of $t$ -connected graphs

Connected graphs with large multiplicity of $- 1$ in the spectrum of the eccentricity matrix