Chang Liu

activity

20202026

most citedSignless Laplacian spectral radius and matching in graphs

4 citations · 7 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2026

Unbalanced spectral Turán problem for color-critical graphs with prescribed large maximum degree

Chang Liu

Let $F$ be a connected color-critical graph with $χ (F) = r + 1 \geq 4$ , let $S_{n, Δ}^{(r)} = (n - Δ) K_{1} \lor T (Δ, r - 1)$ . We determine the graph of maximum adjacency spectral radius among all $n…

math.CO2026

Unbalanced Turán and spectral Turán problems with prescribed large maximum degree

Chang Liu

Classical Turán theory shows that, without additional constraints, the extremal structure of $F$ -free graphs is governed by the chromatic number of $F$ and is asymptotically the ba…

math.CO2023

Eigenvalues and spanning trees with constrained degree

Chang Liu, Jianping Li

In this paper, we study some spanning trees with bounded degree and leaf degree from eigenvalues. For any integer $k \geq 2$ , a $k$ -tree is a spanning tree in which every vertex has…

math.CO2022★ 1 cited

The minimum spectral radius of graphs with a given domination number

Chang Liu, Jianping Li

Let $G_{n, γ}$ be the set of simple and connected graphs on $n$ vertices and with domination number $γ$ . The graph with minimum spectral radius among $G_{n, γ}$ is…

math.CO2022

On the $α$ -spectral radius of the $k$ -uniform supertrees

Chang Liu, Jianping Li

Let $G$ be a $k$ -uniform hypergraph with vertex set $V (G)$ and edge set $E (G)$ . A connected and acyclic hypergraph is called a supertree. For $0 \leq α < 1$ , the $α$ -spectral radius of…

math.CO2022

The maximum $A_{α}$ -spectral radius of $t$ -connected graphs with bounded matching number

Chang Liu, Zimo Yan, Jianping Li

Let $G$ be a graph with adjacency matrix $A (G)$ and let $D (G)$ be a diagonal matrix of the degrees of $G$ . In 2017, Nikiforov defined the $A_{α}$ -matrix of $G$ as \begin{equation*} A…

math.CO2021★ 1 cited

Distance signless Laplacian spectral radius and perfect matching in graphs and bipartite graphs

Chang Liu, Jianping Li

The distance matrix $D$ of a connected graph $G$ is the matrix indexed by the vertices of $G$ which entry $D_{i, j}$ equals the distance between the vertices $v_…

math.CO2021★ 1 cited

Sharp bounds on the zeroth-order general Randić index of trees in terms of domination number

Chang Liu, Jianping Li

The zeroth-order general Randić index of graph $G = (V_{G}, E_{G})$ , denoted by $^{0} R_{α} (G)$ , is the sum of items $(d_{v})^{α}$ over all vertices $v \in V_{G}$ , where $α$ is a pertinently chosen…

math.CO2020★ 4 cited

Signless Laplacian spectral radius and matching in graphs

Chang Liu, Yingui Pan, Jianping Li

The signless Laplacian matrix of a graph $G$ is given by $Q (G) = D (G) + A (G)$ , where $D (G)$ is a diagonal matrix of vertex degrees and $A (G)$ is the adjacency matrix. The largest eigen…

Unbalanced spectral Turán problem for color-critical graphs with prescribed large maximum degree

Unbalanced Turán and spectral Turán problems with prescribed large maximum degree

Eigenvalues and spanning trees with constrained degree

The minimum spectral radius of graphs with a given domination number

On the α-spectral radius of the k-uniform supertrees

The maximum Aα​-spectral radius of t-connected graphs with bounded matching number

Distance signless Laplacian spectral radius and perfect matching in graphs and bipartite graphs

Sharp bounds on the zeroth-order general Randić index of trees in terms of domination number

Signless Laplacian spectral radius and matching in graphs

On the $α$ -spectral radius of the $k$ -uniform supertrees

The maximum $A_{α}$ -spectral radius of $t$ -connected graphs with bounded matching number