Wanting Sun

activity

20212025

most citedAdjacency eigenvalues of graphs without short odd cycles

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

collaborators

14 papers

math.CO2025

Clique factors in random samplings of regular graphs

Wanting Sun, Shunan Wei, Donglei Yang

We show that for any integer $r \geq 2$ , there exists a constant $c > 0$ such that for every sufficiently large integer $n$ , every $((r - 1) n + 1)$ -regular graph $G$ on $r n$ vertices has a…

math.CO2025

A step toward Chen-Lih-Wu conjecture

Yangyang Cheng, Zhenyu Li, Wanting Sun +1

An equitable $k$ -coloring of a graph is a proper $k$ -coloring where the sizes of any two different color classes differ by at most one. In 1973, Meyer conjectured that every connec…

math.CO2025

Subdivision-free graphs with the maximum spectral radius

Wanting Sun, Guanghui Wang, Pingchuan Yang

Given a graph family $H$ , let $SPEX (n, H_{sub})$ denote the set of $n$ -vertex $H$ -subdivision-free graphs with the maximum spectral radius. In t…

math.CO2025

Packing tetrahedrons in edge-weighted graphs

Wanting Sun, Shunan Wei, Donglei Yang

We prove that for all $μ > 0, t \in (0, 1)$ and sufficiently large $n \in 4 N$ , if $G$ is an edge-weighted complete graph on $n$ vertices with a weight function $w: E(G)\rightar…

math.CO2025

Infinitely many accumulation points of codegree Turán densities

Heng Li, Weichan Liu, Bjarne Schülke +1

The codegree Turán density $γ (F)$ of a $k$ -graph $F$ is the smallest $γ \in [0, 1)$ such that every $k$ -graph $H$ with $δ_{k - 1} (H) \geq (γ + o (1)) ∣ V (H) ∣$ contains a copy of $F$ .…

math.CO2025

Transversal Hamilton cycles in digraph collections

Yangyang Cheng, Heng Li, Wanting Sun +1

Given a collection $D = {D_{1}, D_{2}, \dots, D_{m}}$ of digraphs on the common vertex set $V$ , an $m$ -edge digraph $H$ with vertices in $V$ is \textit{transversal} in $\mathcal…

math.CO2024

Transversal Structures in Graph Systems: A Survey

Wanting Sun, Guanghui Wang, Lan Wei

Given a system $G = {G_{1}, G_{2}, \dots, G_{m}}$ of graphs/digraphs/hypergraphs on the common vertex set $V$ of size $n$ , an $m$ -edge graph/digraph/hypergraph $H$ on $V$ is tran…

math.CO2024

Degree-Similar Graphs

Chris Godsil, Wanting Sun

The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$ . If $X_{1}$ and $X_{2}$ are graphs with respective adjacency matri…

math.CO2024

Transversal Hamilton paths and cycles

Yangyang Cheng, Wanting Sun, Guanghui Wang +1

Given a collection $G = {G_{1}, G_{2}, \dots, G_{m}}$ of graphs on the common vertex set $V$ of size $n$ , an $m$ -edge graph $H$ on the same vertex set $V$ is transversal in $\mat…

math.CO2023

Cospectral graphs obtained by edge deletion

Chris Godsil, Wanting Sun, Xiaohong Zhang

Let $M \circ N$ denote the Schur product of two matrices $M$ and $N$ . A graph $X$ with adjacency matrix $A$ is walk regular if $A^{k} \circ I$ is a constant times $I$ for each $k \geq 0$ ,…

math.CO2022

Extensions on spectral extrema of $C_{5} / C_{6}$ -free graphs with given size

Shuchao Li, Wanting Sun, Wei Wei

Let $F$ denote a set of graphs. A graph $G$ is said to be $F$ -free if it does not contain any element of $F$ as a subgraph. The Turán number is the ma…

math.CO2022

Sharp bounds on the $A_{α}$ -index of graphs in terms of the independence number

Wanting Sun, Lixia Yan, Shuchao Li +1

Given a graph $G$ , the adjacency matrix and degree diagonal matrix of $G$ are denoted by $A (G)$ and $D (G)$ , respectively. In 2017, Nikiforov \cite{0007} proposed the $A_{α}$ -matrix:…

math.CO2021★ 3 cited

Adjacency eigenvalues of graphs without short odd cycles

Shuchao Li, Wanting Sun, Yuantian Yu

It is well known that spectral Turán type problem is one of the most classical {problems} in graph theory. In this paper, we consider the spectral Turán type problem. Let $G$ be a…

math.CO2021

An arithmetic criterion for graphs being determined by their generalized $A_{α}$ -spectrum

Shuchao Li, Wanting Sun

Let $G$ be a graph on $n$ vertices, its adjacency matrix and degree diagonal matrix are denoted by $A (G)$ and $D (G)$ , respectively. In 2017, Nikiforov \cite{0007} introduced the ma…

Clique factors in random samplings of regular graphs

A step toward Chen-Lih-Wu conjecture

Subdivision-free graphs with the maximum spectral radius

Packing tetrahedrons in edge-weighted graphs

Infinitely many accumulation points of codegree Turán densities

Transversal Hamilton cycles in digraph collections

Transversal Structures in Graph Systems: A Survey

Degree-Similar Graphs

Transversal Hamilton paths and cycles

Cospectral graphs obtained by edge deletion

Extensions on spectral extrema of C5​/C6​-free graphs with given size

Sharp bounds on the Aα​-index of graphs in terms of the independence number

Adjacency eigenvalues of graphs without short odd cycles

An arithmetic criterion for graphs being determined by their generalized Aα​-spectrum

Extensions on spectral extrema of $C_{5} / C_{6}$ -free graphs with given size

Sharp bounds on the $A_{α}$ -index of graphs in terms of the independence number

An arithmetic criterion for graphs being determined by their generalized $A_{α}$ -spectrum