◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Tingyan Ma

4 papers hereh-index 326 citations12 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author4

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.CO4
same name
  • Tingyan Ma — 2 papers, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20222025
most citedThe sufficient conditions for k-leaf-connected graphs in terms of several topological indices

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

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⊆G with ∣S∣=k. A connected graph G is called t-connected if it has more than $…

math.CO2023

Distance spectral conditions for ID-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 ID-factor-critical if for every independent set I of G whose size has the same parity a…

math.CO2023★ 1 cited

The sufficient conditions for k-leaf-connected graphs in terms of several topological indices

Tingyan Ma, Ligong Wang, Yang Hu

Let G=(V(G),E(G)) be a graph with vertex set V(G) and edge set E(G). For k≥2 and given any subset S⊆∣V(G)∣ with ∣S∣=k, if a graph G of order $|V(G)|\geq k…

math.CO2022

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

Tingyan Ma, Guoyan Ao, Ruifang Liu +2

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

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.