1 citations · 1 across the 4 of their papers we have counts for
4 papers
math.CO2025
Spectral condition for -factor-criticality in -connected graphs
Tingyan Ma, Edwin R. van Dam, Ligong Wang
A graph is called -factor-critical if has a perfect matching for every with . A connected graph is called -connected if it has more than $…
math.CO2023
Distance spectral conditions for -factor-critical and fractional -factor of graphs
Tingyan Ma, Ligong Wang
Let be a graph with vertex set and edge set . A graph is -factor-critical if for every independent set of whose size has the same parity a…
math.CO2023★ 1 cited
The sufficient conditions for -leaf-connected graphs in terms of several topological indices
Tingyan Ma, Ligong Wang, Yang Hu
Let be a graph with vertex set and edge set . For and given any subset with , if a graph of order $|V(G)|\geq k…
math.CO2022
An improvement of sufficient condition for -leaf-connected graphs
Tingyan Ma, Guoyan Ao, Ruifang Liu +2
For integer a graph is called -leaf-connected if and given any subset with always has a spanning tree such that…