◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sanming Zhou

22 papers hereh-index 8209 citations28 works total

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

author position
  • middle author2
  • last author20

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

fields
  • math.CO20
  • math.GR2
same name
  • Sanming Zhou — 14 papers, h 14
  • Sanming Zhou — 9 papers, h 5
  • Sanming Zhou — 6 papers, h 6
  • Sanming Zhou — 6 papers, h 5
  • Sanming Zhou — 3 papers, h 7
  • Sanming Zhou — 3 papers, h 3

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
20122026
most citedCanonical double covers of generalized Petersen graphs, and double generalized Petersen graphs

10 citations · 34 across the 20 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

math.CO2016

Cores of imprimitive symmetric graphs of order a product of two distinct primes

Ricky Rotheram, Sanming Zhou

A retract of a graph Γ is an induced subgraph Ψ of Γ such that there exists a homomorphism from Γ to Ψ whose restriction to Ψ is the identity map. A graph is a core if…

math.CO2016★ 1 cited

Classification of tetravalent 2-transitive non-normal Cayley graphs of finite simple groups

Xin Gui Fang, Jie Wang, Sanming Zhou

A graph Γ is called (G,s)-arc-transitive if G≤Aut(Γ) is transitive on the set of vertices of Γ and the set of s-arcs of Γ, where for an integer s≥1…

math.CO2016

Perfect codes in Cayley graphs

He Huang, Binzhou Xia, Sanming Zhou

Given a graph Γ, a subset C of V(Γ) is called a perfect code in Γ if every vertex of Γ is at distance no more than one to exactly one vertex in C, and a subset C of $…

math.GR2016

Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks

Teng Fang, Xin Gui Fang, Binzhou Xia +1

A graph Γ is called G-symmetric if it admits G as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $…

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