◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yi Wang

18 papers hereh-index 11360 citations31 works total

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

author position
  • first author1
  • middle author8
  • last author8

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

fields
  • math.CO18
same name
  • Yi Wang — 90 papers, h 10
  • Yi Wang — 89 papers, h 5
  • Yi Wang — 88 papers, h 73
  • Yi Wang — 87 papers, h 35
  • Yi Wang — 64 papers, h 5
  • Yi Wang — 42 papers, h 18

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 citedEigenvectors of Laplacian or signless Laplacian of Hypergraphs Associated with Zero Eigenvalue

11 citations · 38 across the 16 of their papers we have counts for

collaborators
Showing 2020Show all

4 papers · 1 filter

math.CO2020★ 2 cited

A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs

Yi Wang, Le Wang, Yi-Zheng Fan

An oriented hypergraph is a hypergraph together with an incidence orientation such that each edge-vertex incidence is given a label of +1 or −1. An oriented hypergraph is calle…

math.CO2020

On the largest eigenvalue of a mixed graph with partial orientation

Bo-Jun Yuan, Yi Wang, Yi-Zheng Fan

Let G be a connected graph and let T be a spanning tree of G. A partial orientation σ of G respect to T is an orientation of the edges of G except those edges of T,…

math.CO2020

Minimal non-odd-transversal hypergraphs and minimal non-odd-bipartite hypergraphs

Yi-Zheng Fan, Yi Wang, Jiang-Chao Wan

Among all uniform hypergraphs with even uniformity, the odd-transversal or odd-bipartite hypergraphs are more close to bipartite simple graphs from the viewpoint of both structure…

math.CO2020★ 1 cited

The least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices

Yi-Zheng Fan, Zhu Zhu, Yi Wang

Let G be a connected hypergraph with even uniformity, which contains cut vertices. Then G is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a…

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