The following pages link to Shengjin Ji (Q244381):
Displaying 28 items.
- The maximum matching energy of bicyclic graphs with even girth (Q277654) (← links)
- Solution to a conjecture on the maximal energy of bipartite bicyclic graphs (Q541944) (← links)
- On the tree with diameter 4 and maximal energy (Q668121) (← links)
- The reformulated Zagreb indices of tricyclic graphs (Q668156) (← links)
- The matching energy of graphs with given edge connectivity (Q903380) (← links)
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices (Q1674365) (← links)
- A lower bound of revised Szeged index of bicyclic graphs (Q1740444) (← links)
- Note on forcing problem of trees (Q2062888) (← links)
- On the general position number of two classes of graphs (Q2084225) (← links)
- On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3 (Q2345610) (← links)
- Correction to: ``Note on forcing problem of trees'' (Q2667922) (← links)
- (Q2856751) (← links)
- (Q2975359) (← links)
- (Q4598984) (← links)
- (Q4903449) (← links)
- (Q4903452) (← links)
- On the minimal energy of tetracyclic graphs (Q5005656) (← links)
- (Q5280037) (← links)
- (Q5408316) (← links)
- (Q5498080) (← links)
- The matching energy of graphs with given edge connectivity (Q5502397) (← links)
- Note on unicyclic graphs with given number of pendent vertices and minimal energy (Q5962290) (← links)
- On minimum revised edge Szeged index of bicyclic graphs (Q6101471) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- Bounding the total forcing number of graphs (Q6181334) (← links)
- On reformulated zagreb indices with respect to tricyclic graphs (Q6252690) (← links)
- The multiplicative Zagreb indices of graphs with given connectivity or number of pendant vertices (Q6294340) (← links)
- On the general position set of two classes of graphs (Q6334375) (← links)