Chang Liu

most citedDistance signless Laplacian spectral radius and perfect matching in graphs and bipartite graphs

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

collaborators

4 papers

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

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…

The minimum spectral radius of graphs with a given domination number

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

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