Tingyan Ma

activity

20222025

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

Spectral condition for $k$ -factor-criticality in $t$ -connected graphs

Tingyan Ma, Edwin R. van Dam, Ligong Wang

A graph $G$ is called $k$ -factor-critical if $G - S$ has a perfect matching for every $S \subseteq G$ with $∣ S ∣ = k$ . A connected graph $G$ is called $t$ -connected if it has more than $…

math.CO2023

Distance spectral conditions for $I D$ -factor-critical and fractional $[a, b]$ -factor of graphs

Tingyan Ma, Ligong Wang

Let $G = (V (G), E (G))$ be a graph with vertex set $V (G)$ and edge set $E (G)$ . A graph is $I D$ -factor-critical if for every independent set $I$ of $G$ whose size has the same parity a…

math.CO2022

An improvement of sufficient condition for $k$ -leaf-connected graphs

Tingyan Ma, Guoyan Ao, Ruifang Liu +2

For integer $k \geq 2,$ a graph $G$ is called $k$ -leaf-connected if $∣ V (G) ∣ \geq k + 1$ and given any subset $S \subseteq V (G)$ with $∣ S ∣ = k,$ $G$ always has a spanning tree $T$ such that…

Spectral condition for k-factor-criticality in t-connected graphs

Distance spectral conditions for ID-factor-critical and fractional [a,b]-factor of graphs

An improvement of sufficient condition for k-leaf-connected graphs

Spectral condition for $k$ -factor-criticality in $t$ -connected graphs

Distance spectral conditions for $I D$ -factor-critical and fractional $[a, b]$ -factor of graphs

An improvement of sufficient condition for $k$ -leaf-connected graphs