activity
20242026
collaborators

11 papers

math.CO2026

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

Zhenhao Zhang, Ligong Wang

Let $\mbox{odd}(G)$ and denote the number of nontrivial odd components and the number of isolated vertices of a graph , respectively. The -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 be a positive integer and let be a simple graph of order with minimum degree . A graph is said to have property if it contains edge-disjoi…

math.CO2026

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

Yongbin Gao, Ligong Wang

Let be a positive integer and let be a simple graph of order with minimum degree . A graph is said to have property if it contains edge-disjoint sp…

math.CO2025

Spectral extremal problems for -critical and fractional -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 -factors based on eigenvalue conditions can be traced bac…

math.CO2025

Spectral radius and size conditions for fractional -covered graphs

Zengzhao Xu, Ligong Wang, Weige Xi

A fractional -covered graph is a generalization of the concept of a fractional -covered graph. For any with edge set , if there exists a…

math.CO2025

Tricyclic graphs for which the second largest distance eigenvalue less than

Kexin Yang, Ligong Wang

Let be a simple connected graph with vertex set . The distance between two vertices and of is the length of…