Showing math.COShow all
4 papers · 1 filter
math.CO2026
Size and spectral conditions for a graph with given minimum degree to be --critical
Zhenhao Zhang, Xiaogang Liu, Ligong Wang
A -matching in a graph is defined as a function satisfying for each vertex , where $E_G(v…
math.CO2026
Distance spectral radius conditions for perfect -matching, generalized factor-criticality (bicriticality) and --criticality of graphs
Kexin Yang, Ligong Wang, Zhenhao Zhang
Let be a simple connected graph with vertex set and edge set . A -matching of a graph is a function satisfying $\sum_{…
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.CO2025
On the distance signless Laplacian spectral radius, fractional matching and factors of graphs
Z. H. Zhang, L. G. Wang
The distance signless Laplacian matrix of a graph is define as Tr, where Tr and are the diagonal matrix of vertex transmissions and the distance ma…