Ligong Wang

activity

20242026

collaborators

15 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.CO2026

Spectral radius conditions for edge-disjoint spanning trees in $(k + c)$ -edge-connected graphs

Yongbin Gao, Ligong Wang

Let $I ¨ (G)$ denote the spanning tree packing number of a graph $G$ . Recently, Zhang and Fan [J. Graph Theory 112 (2) (2026) 128--144] posed the problem of finding a tight spectral…

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.CO2026

Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and $k$ - $d$ -critical graphs

Zhenhao Zhang, Ligong Wang

Let $\mbox{odd}(G)$ and $i (G)$ denote the number of nontrivial odd components and the number of isolated vertices of a graph $G$ , respectively. The $k$ -Berge-Tutte-formula of a gra…

math.CO2026

Distance spectral radius conditions for edge-disjoint spanning trees and a forest with constraints

Yongbin Gao, Ligong Wang

Let $k \geq 2$ be a positive integer and let $G$ be a simple graph of order $n$ with minimum degree $I^´$ . A graph $G$ is said to have property $P (k, d)$ if it contains $k$ edge-disjo…

math.CO2026

Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints

Yongbin Gao, Ligong Wang

Let $k$ be a positive integer and let $G$ be a simple graph of order $n$ with minimum degree $I^´$ . A graph $G$ is said to have property $P (k, d)$ if it contains $k$ edge-disjoint s…

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

Spectral radius conditions for edge-disjoint spanning trees in (k+c)-edge-connected graphs

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

Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and k-d-critical graphs

Distance spectral radius conditions for edge-disjoint spanning trees and a forest with constraints

Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints

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

Spectral radius conditions for edge-disjoint spanning trees in $(k + c)$ -edge-connected graphs

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

Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and $k$ - $d$ -critical graphs