Jing Huang

collaborators

5 papers

math.CO2026

The Distance Between the Adjacency Spectral Center and the Characteristic Set of a Tree

Chaochao Zhu, Shipei Hu, Jingfu Huang +1

Let $S (T)$ be the adjacency spectral center of a tree $T$ , and let $C (T)$ be its characteristic set. We determine the largest possible separation $d(T) := \operat…

math.AC2026

The Separating Noether Number of Finite Abelian Groups

Jing Huang

For a finite abelian group $G$ , let $β_{sep} (G)$ denote its separating Noether number. We determine $β_{sep} (G)$ exactly for every finite abelian group $ G \cong…

math.CO2026

A Proof of a Conjecture of Móricz and Nagy on Rational-Value Sums

Jing Huang

Móricz and Nagy introduced the problem of maximizing the number of $r$ -element subsets with rational sums in an $n$ -element set of irrational numbers, and showed that it is equival…

math.CO2025

Sharp lower bounds and extremal graphs for the generalized $k$ -independence number

Jing Huang, Jiaxin Tang

A vertex set $S$ is a generalized $k$ -independent set if the induced subgraph $G [S]$ contains no tree on $k$ vertices. The generalized $k$ -independence number $α_{k} (G)$ is the maxim…

math.CO2025

A sharp lower bound on the generalized 4-independence number

Jing Huang

For a graph $G$ , a vertex subset $S$ is called a maximum generalized $k$ -independent set if the induced subgraph $G [S]$ does not contain a $k$ -tree as its subgraph, and the subset…

The Distance Between the Adjacency Spectral Center and the Characteristic Set of a Tree

The Separating Noether Number of Finite Abelian Groups

A Proof of a Conjecture of Móricz and Nagy on Rational-Value Sums

Sharp lower bounds and extremal graphs for the generalized k-independence number

A sharp lower bound on the generalized 4-independence number

Sharp lower bounds and extremal graphs for the generalized $k$ -independence number