Xinying Tang

collaborators

3 papers

math.CO2026

Spectral radius and maximum matching covered graphs with bounded matching number

Xinying Tang, Wenqian Zhang

Let $G$ be a graph. The {\em spectral radius} of $G$ is the largest eigenvalue of its {\em adjacency matrix}. A {\em matching} of $G$ is a set of disjoint edges of $G$ . The {\em ma…

math.CO2026

Spectral radius and edge-disjoint connected factors of graphs

Xinying Tang, Wenqian Zhang

For a graph $G$ , the spectral radius of $G$ is the largest eigenvalue of its adjacency matrix. A connected factor of $G$ is a connected spanning subgraph of $G$ . For example, a spa…

math.CO2025

Spectral conditions for graphs to contain $k$ -factors

Xinying Tang, Wenqian Zhang

Let $G$ be a graph. The spectral radius $I ¨ (G)$ of $G$ is the largest eigenvalue of its adjacency matrix. For an integer $k \geq 1$ , a $k$ -factor of $G$ is a $k$ -regular spanning sub…

Spectral radius and maximum matching covered graphs with bounded matching number

Spectral radius and edge-disjoint connected factors of graphs

Spectral conditions for graphs to contain k-factors

Spectral conditions for graphs to contain $k$ -factors