Jianping Li

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

P_{2}

and

C_{n}

6 citations · 9 across the 3 of their papers we have counts for

collaborators

3 papers

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…

math.CO2019★ 3 cited

Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed polyomino chains

Yingui Pan, Jianping Li

Let $G_{n}$ be a linear crossed polyomino chain with $n$ four-order complete graphs. In this paper, explicit formulas for the Kirchhoff index, the multiplicative degree-Kirchhoff ind…

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

Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed polyomino chains

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