◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Zejun Huang

5 papers hereh-index 13 citations5 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.CO5
same name
  • Zejun Huang — 18 papers, h 12
  • Zejun Huang — 7 papers, h 1
  • Zejun Huang — 3 papers, h 1
  • Zejun Huang — 1 paper
  • Zejun Huang — 1 paper, h 0

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

collaborators

5 papers

math.CO2026

Extremal spectral radius of nonregular graphs with a fixed odd maximum degree

Zejun Huang, Chenxi Yang

For integers n≥3 and 2≤Δ≤n−1, let λ1​(n,Δ) be the maximum adjacency spectral radius among all connected nonregular graphs of order n and maximum degree Δ. Liu conj…

math.CO2026

Three Results on Generalized Quasikernels in Digraphs

Zejun Huang, Chenxi Yang

A q-kernel of a digraph D is an independent set Q⊆D such that every vertex of D is reachable from Q by a directed path of length at most q, which is a natural…

math.CO2024

Nonregular graphs with a given maximum degree attaining maximum spectral radius

Zejun Huang, Jiahui Liu, Chenxi Yang

Let G be a connected nonregular graphs of order n with maximum degree Δ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that G has…

math.CO2024

Extremal digraphs containing at most t paths of length 2 with the same endpoints

Zejun Huang, Zhenhua Lyu

Given a positive integer t, let Pt,2​ be the digraph consisting of t directed paths of length 2 with the same initial and terminal vertices. In this paper, we study the max…

math.CO2024

Extremal oriented graphs avoiding 1-subdivision of an in-star

Zejun Huang, Chenxi Yang

An oriented graph is a digraph obtained from an undirected graph by choosing an orientation for each edge. Given a positive integer n and an oriented graph F, the oriented Tur$…

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