activity
20242026
collaborators
Showing 2026Show all

14 papers · 1 filter

math.CO2026

The number of Laplacian eigenvalues of trees less than one

Jiaxin Guo, Tao Hu, Quanyu Tang

Let denote the number of Laplacian eigenvalues of a tree that are strictly less than . Guo, Xue and Liu \cite{GXL} proved that every tree of diameter sati…

math.NT2026

Integral Representations and Asymptotics for a Family of Areal Mahler Measures

Quanyu Tang, Shu Zhang

We study a problem posed by Matilde Lalín concerning the areal Mahler measures of the multivariable polynomial family $$ P_m(x_1,\ldots,x_m,u) = \prod_{j=1}^m(1+x_j) + u\prod_{j=1}…

math.CO2026

The -Conjecture for CIS -Graphs

Yinchen Liu, Quanyu Tang

We prove the -conjecture, which dates back to Gurvich's 1978 thesis. Specifically, let the edges of a complete graph be colored with colors , and for each let $G…

math.CO2026

Nearly permanental cospectral graphs

Weifang Lv, Quanyu Tang, Wei Wang +1

Let be a simple graph of order with adjacency matrix . The \emph{determinant} and the \emph{permanen}t of the matrix are defined as \[\mathrm{det}A= \sum_{…

math.CO2026

A Family of Simultaneously Cospectral Trees for Degree-Distance Matrices

Limeng Lin, Quanyu Tang, Kehua Wang +1

Spectral characterization of graphs for various graph matrices constitutes a central topic in spectral graph theory. Let be a graph with adjacency matrix , diagonal degre…

math.CO2026

Graph Eigenvalues and Projection Constants

Varun Sivashankar, Quanyu Tang, Tanay Wakhare

For an integer , let denote the th largest adjacency eigenvalue of a graph . For every graph on vertices and every , we prove \[ λ_k(…

math.CO2026

Minimum-rank parameters of complements of threshold Kneser graphs

Tao Hu, Quanyu Tang

Let be the graph whose vertices are the -subsets of , with two distinct vertices adjacent whenever their intersection has size at least . Equivalently,…

math.CO2026

A positive square-energy strengthening of Turán's theorem

Yinchen Liu, Quanyu Tang, Shengtong Zhang

Let be an -vertex graph with clique number , and let denote the sum of the squared positive adjacency eigenvalues. We prove that $$ \sqrt{s^+(G)}\le\left(1-\f…

math.CO2026

The positive and negative square-energy conjecture

Yinchen Liu, Quanyu Tang, Shengtong Zhang

Let and denote the sums of the squares of the positive and negative adjacency eigenvalues of a graph , respectively. We prove the conjecture of Elphick, Farber…

math.CO2026

Irregular subgraph in a regular graph

Tianyue Cao, Quanyu Tang, Hehui Wu

A conjecture of Alon and Wei states that, for any -regular graph with vertices, there exists a spanning subgraph such that for all , we have ,…

math.CO2026

Generalized spectral closedness of -free graph classes

Wei Wang, Quanyu Tang

In this paper, we investigate the generalized spectral closedness of graph classes defined by a family of forbidden induced subgraphs. To systematically study this pr…

math.CO2026

Path-Minimality for Positive -Energies, Laplacian-Type Spectra, and Line Graphs

Yinchen Liu, Quanyu Tang

We derive several applications of the path-minimality theorem for adjacency -energy proved in the companion paper. First, we prove the sharp inequality $$ \mathcal E_p^+(G)\ge \…

math.CO2026

Factorization of invariant polynomials and generalized spectral characterizations of graphs

Wei Wang, Quanyu Tang

The problem of characterizing graphs by their generalized spectra has received significant attention in recent years. This paper provides a complete proof of a conjecture proposed…

math.NT2026

The Hofstadter consecutive-sum sequence omits infinitely many positive integers

Quanyu Tang

Let be the greedy self-generating sequence defined by , , and, for , by taking to be the least integer greater than that can…