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

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

collaborators

10 papers

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…

math.CO2017

Generalized Multiplicative Indices of Polycyclic Aromatic Hydrocarbons and Benzeniod Systems

V. R. Kulli, Branden Stone, Shaohui Wang +1

Many types of topological indices such as degree-based topological indices, distance-based topological indices and counting related topological indices are explored during past rec…

math.CO2016

A note on the independent domination number versus the domination number in bipartite graphs

Shaohui Wang, Bing Wei

Let and be the domination number and the independent domination number of , respectively. Rad and Volkmann posted a conjecture that for an…

math.CO20161 cited

The Wiener Index and the Hosoya Polynomial of the Jahangir Graphs

Shaohui Wang, Mohammad Reza Farahani, M. R. Rajesh Kanna +2

Let G be a simple connected graph having vertex set V and edge set E. The vertex-set and edge-set of G denoted by V(G) and E(G), respectively. The length of the smallest path betwe…

math.CO20161 cited

Total domination polynomials of graphs

Jiuhua Hu, Erfang Shan, Shaohui Wang +2

Given a graph , a total dominating set is a vertex set that every vertex of is adjacent to some vertices of and let be the number of all total dominat…