Jianping Li

activity

20132022

most citedResistance distance-based graph invariants and spanning trees of graphs derived from the strong product of

P_{2}

and

C_{n}

6 citations · 15 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

8 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

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.CO2019★ 6 cited

Resistance distance-based graph invariants and spanning trees of graphs derived from the strong product of $P_{2}$ and $C_{n}$

Yingui Pan, Jianping Li

Let $G_{n}$ be a graph obtained by the strong product of $P_{2}$ and $C_{n}$ , where $n ⩾ 3$ . In this paper, explicit expressions for the Kirchhoff index, multiplicative degree-Kirc…

math.CO2019

Signless Laplacian spectral radius and fractional matchings in graphs

Yingui Pan, Jianping Li

A fractional matching of a graph $G$ is a function $f$ giving each edge a number in $[0, 1]$ such that $\sum_{e \in Γ (v)} f (e) \leq 1$ for each vertex $v \in V (G)$ , where $Γ (v)$ is the se…

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

Resistance distance-based graph invariants and spanning trees of graphs derived from the strong product of P2​ and Cn​

Signless Laplacian spectral radius and fractional matchings in graphs

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

Resistance distance-based graph invariants and spanning trees of graphs derived from the strong product of $P_{2}$ and $C_{n}$