activity
20162020
most citedOn the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices

2 citations · 4 across the 5 of their papers we have counts for

collaborators
Showing math.COShow all

14 papers · 1 filter

math.CO2020

The Laplacian spectrum, Kirchhoff index and complexity of the linear heptagonal networks

Jia-Bao Liu, Jing Chen, Jing Zhao +1

Let be the linear heptagonal networks with heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian…

math.CO2018

Changing and unchanging 2-rainbow independent domination

Pu Wu, Zehui Shao, Vladimir Samodivkin +3

For a function we denote by the set of vertices to which the value is assigned by , i.e. . If…

math.CO2018

On the largest -spectral radius of cacti

Shaohui Wang, Chunxiang Wang, Jia-Bao Liu +1

Let be the adjacent matrix and the diagonal matrix of the degrees of a graph , respectively. For , the matrix is…

math.CO2018

The characterization of perfect Roman domination stable trees

Zepeng Li, Zehui Shao, Yongsheng Rao +2

A \emph{perfect Roman dominating function} (PRDF) on a graph is a function satisfying the condition that every vertex for which $f(…

math.CO20172 cited

On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices

Shengjin Ji, Shaohui Wang

The first Zagreb index of a graph is the sum of the square of every vertex degree, while the second Zagreb index is the sum of the product of vertex degrees of each edge over a…

math.CO2017

On the maximum and minimum multiplicative Zagreb indices of graphs with given number of cut edges

Shaohui Wang, Chunxiang Wang, Lin Chen

For a molecular graph, the first multiplicative Zagreb index is equal to the product of the square of the degree of the vertices, while the second multiplicative Zagreb index…