An Chang

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

The spectral radius of $1$ -planar graphs without complete subgraphs

Weilun Xu, An Chang

A 1-planar graph refers to a graph that can be drawn on the plane such that each edge has at most one crossing. In this paper, focusing on the spectral TurÃ¡n-type problems of $1$ -…

math.CO2024

Almost regular subgraphs under spectral radius constrains

Weilun Xu, Guorong Gao, An Chang

A graph is called $K$ -almost regular if its maximum degree is at most $K$ times the minimum degree. ErdÅs and Simonovits showed that for a constant $0 < ε < 1$ and a suffi…

math.CO2024

The maximum spectral radius of planner graphs without the joint of K2 and a linear forest

Weilun Xu, An Chang

Given a graph $F$ , let $S P E X_{P} (n, F)$ be the set of graphs with the maximum spectral radius among all $F$ -free $n$ -vertex planner graph. In 2017, Tait and Tobin proved that for suff…

The spectral radius of 1-planar graphs without complete subgraphs

Almost regular subgraphs under spectral radius constrains

The maximum spectral radius of planner graphs without the joint of K2 and a linear forest

The spectral radius of $1$ -planar graphs without complete subgraphs