Weige Xi

collaborators

7 papers

math.CO2026

Spectral extremal problems for fractional $I D$ - $[a, b]$ -factor-critical graphs

Zengzhao Xu, Ligong Wang, Weige Xi

A factor of a graph is essentially a specific type spanning subgraph. In recent years, the spectral extremal problem of characterizing the existence of graph factors via eigenvalue…

math.CO2025

Spectral extremal problems for $(a, b, k)$ -critical and fractional $(a, b, k)$ -critical graphs

Zengzhao Xu, Ligong Wang, Weige Xi

A factor of a graph is essentially a specific type spanning subgraph. The study of characterizing the existence of $[a, b]$ -factors based on eigenvalue conditions can be traced bac…

math.CO2025

Spectral radius and size conditions for fractional $(a, b, m)$ -covered graphs

Zengzhao Xu, Ligong Wang, Weige Xi

A fractional $(a, b, m)$ -covered graph is a generalization of the concept of a fractional $[a, b]$ -covered graph. For any $H \subseteq G$ with edge set $∣ E (H) ∣ = m$ , if there exists a…

math.CO2025

On the $D_{I^} \pm$ spectral radius of non-transmission regular graphs

Zengzhao Xu, Weige Xi, Ligong Wang

Let $G$ be a connected graph with order $n$ and size $m$ . Let $D (G)$ and $T r (G)$ be the distance matrix and diagonal matrix with vertex transmissions of $G$ , respectively. For any…

math.CO2025

Matching, odd $[1, b]$ -factor and distance spectral radius of graphs with given some parameters

Zengzhao Xu, Weige Xi, Ligong Wang

For a connected graph $G$ , let $I^¼ (G)$ denote the distance spectral radius of $G$ . A matching in a graph $G$ is a set of disjoint edges of $G$ . The maximum size of a matching in $G…

math.CO2025

On the distance spectral radius, fractional matching and factors of graphs with given minimum degree

Zengzhao Xu, Weige Xi, Ligong Wang

A fractional matching of $G$ is a function $f : E (G) \to [0, 1]$ such that $\sum_{e \in E_{G} (v_{i})} f (e) \leq 1$ for any $v_{i} \in V (G)$ , where $E_G(v_i)=\{e: e\in E(G) \ \textrm{and}\ e \ \t…

Spectral extremal problems for fractional ID-[a,b]-factor-critical graphs

Spectral extremal problems for (a,b,k)-critical and fractional (a,b,k)-critical graphs

Spectral radius and size conditions for fractional (a,b,m)-covered graphs

On the DI^​± spectral radius of non-transmission regular graphs

Matching, odd [1,b]-factor and distance spectral radius of graphs with given some parameters

On the distance spectral radius, fractional matching and factors of graphs with given minimum degree

Spectral extremal problems for fractional $I D$ - $[a, b]$ -factor-critical graphs

Spectral extremal problems for $(a, b, k)$ -critical and fractional $(a, b, k)$ -critical graphs

Spectral radius and size conditions for fractional $(a, b, m)$ -covered graphs

On the $D_{I^} \pm$ spectral radius of non-transmission regular graphs

Matching, odd $[1, b]$ -factor and distance spectral radius of graphs with given some parameters