4 citations · 7 across the 7 of their papers we have counts for
7 papers
On the general position set of two classes of graphs
Yan Yao, Mengya He, Shengjin Ji +1
The general position problem is to find the cardinality of a largest vertex subset S such that no triple of vertices of S lie on a common geodesic. For a connected graph G, the car…
The multiplicative Zagreb indices of graphs with given connectivity or number of pendant vertices
Shengjin Ji, Shaohui Wang, Tilahun Muche +1
For a graph , the first multiplicative Zagreb index is the product of squares of vertex degrees, and the second multiplicative Zagreb index is the pr…
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…
On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3
Hongping Ma, Yongqiang Bai, Shengjin Ji
The energy of a graph , denoted by , is defined as the sum of the absolute values of all eigenvalues of . Let be an even number and be the set of a…
On reformulated zagreb indices with respect to tricyclic graphs
Shengjin Ji, Xia Li, Yongke Qu
The authors Milievi et al. introduced the reformulated Zagreb indices, which is a generalization of classical Zagreb indices of chemical graph theory. In the…
The matching energy of graphs with given edge connectivity
Shengjin Ji, Hongping Ma
Let G be a simple graph of order and the roots of its matching polynomial. The matching energy of is defined as the sum . Let $K_{n-…
Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
Bofeng Huo, Shengjin Ji, Xueliang Li +1
The energy of a simple graph , denoted by , is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let denote the cycle of order $n…