Kexin Yang

collaborators

3 papers

math.CO2026

Distance spectral radius conditions for perfect $k$ -matching, generalized factor-criticality (bicriticality) and $k$ - $d$ -criticality of graphs

Kexin Yang, Ligong Wang, Zhenhao Zhang

Let $G$ be a simple connected graph with vertex set $V (G)$ and edge set $E (G)$ . A $k$ -matching of a graph $G$ is a function $f : E (G) \to {0, 1, \dots, k}$ satisfying $\sum_{…

math.CO2025

A note on the second-largest number of dissociation sets in connected graphs

Pingshan Li, Ke Yang, Wei Jin

A subset of vertices is called a dissociation set if it induces a subgraph with vertex degree at most one. Recently, Yuan et al. established the upper bound of the maximum number o…

math.CO2025

Tricyclic graphs for which the second largest distance eigenvalue less than $- \frac{1}{2}$

Kexin Yang, Ligong Wang

Let $G$ be a simple connected graph with vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ . The distance $d_{G} (v_{i}, v_{j})$ between two vertices $v_{i}$ and $v_{j}$ of $G$ is the length of…

Distance spectral radius conditions for perfect k-matching, generalized factor-criticality (bicriticality) and k-d-criticality of graphs

A note on the second-largest number of dissociation sets in connected graphs

Tricyclic graphs for which the second largest distance eigenvalue less than −21​

Distance spectral radius conditions for perfect $k$ -matching, generalized factor-criticality (bicriticality) and $k$ - $d$ -criticality of graphs

Tricyclic graphs for which the second largest distance eigenvalue less than $- \frac{1}{2}$