◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Su Wang

5 papers hereh-index 8187 citations21 works total

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

author position
  • first author5

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

fields
  • math.CO4
  • cond-mat.quant-gas1
same name
  • Su Wang — 24 papers, h 10
  • Su Wang — 17 papers, h 5
  • Su Wang — 15 papers, h 10
  • Su Wang — 8 papers, h 3
  • Su Wang — 6 papers, h 6
  • Su Wang — 3 papers, h 32

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
20172026
most citedTopological Fulde-Ferrell states in alkaline-earth-metal-like atoms near an orbital Feshbach resonance

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

collaborators
Showing math.COShow all

4 papers · 1 filter

math.CO2026

Spectral radius for the existence of Hb​-factors in binding graphs

Sufang Wang, Wei Zhang

The binding number, denoted by $\mbox{bind}(G)$, of a graph G is defined as the minimum value of ∣X∣∣NG​(X)∣​ taken over any non-empty subset X of V(G) with $N_G(X)…

math.CO2025

Distance spectral radius for a graph to be k-critical with respect to [1,b]-odd factor

Sufang Wang, Wei Zhang

Let G be a connected graph, and let b and k be two positive integers with b≡1 (mod 2). A [1,b]-odd factor of G is a spanning subgraph F of G with $d_F(v)\equiv…

math.CO2024

Toughness and spectral radius in graphs

Sufang Wang, Wei Zhang

Let t be a positive integer, and let G be a connected graph of order n with n≥t+2. A graph G is said to be t1​-tough if ∣S∣≥t1​c(G−S) for every…

math.CO2024

Spanning trees and signless Laplacian spectral radius in graphs

Sufang Wang, Wei Zhang

Let G be a connected graph and let k be a positive integer. Let T be a spanning tree of G. The leaf degree of a vertex v∈V(T) is defined as the number of leaves adjace…

◍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.