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

Showing 2022Show all

3 papers · 1 filter

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…

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

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

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