64 citations · 64 across the 5 of their papers we have counts for
5 papers
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…
On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree
Shaohui Wang, Chunxiang Wang, Lin Chen +1
The first multiplicative Zagreb index of a graph is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the product…
On various (strong) rainbow connection numbers of graphs
Lin Chen, Xueliang Li, Henry Liu +1
An edge-coloured path is \emph{rainbow} if all the edges have distinct colours. For a connected graph , the \emph{rainbow connection number} is the minimum number of col…
Matching Energy of Unicyclic and Bicyclic Graphs with a Given Diameter
Lin Chen, Jinfeng Liu, Yongtang Shi
Gutman and Wagner proposed the concept of matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let be a simple graph of order and…
The Maximal Matching Energy of Tricyclic Graphs
Lin Chen, Yongtang Shi
Gutman and Wagner proposed the concept of the matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let be a simple graph of order …