The Extremal Results for Forcing Problem of Trees.
Graphs Comb., August, 2025
$(K_{1}\vee {P_{t})}$-saturated graphs with minimum number of edges.
J. Comb. Optim., March, 2025
Some results on the saturation number of graphs.
Discret. Appl. Math., 2025
The zero forcing number of claw-free cubic graphs.
Discret. Appl. Math., 2024
Bounding the total forcing number of graphs.
J. Comb. Optim., November, 2023
The Zero Forcing Number of Graphs with the Matching Number and the Cyclomatic Number.
Graphs Comb., August, 2023
On minimum revised edge Szeged index of bicyclic graphs.
AKCE Int. J. Graphs Comb., September, 2022
Extremal Structure on Revised Edge-Szeged Index with Respect to Tricyclic Graphs.
Symmetry, 2022
Correction to: Note on Forcing Problem of Trees.
Graphs Comb., 2022
Note on Forcing Problem of Trees.
Graphs Comb., 2022
On the Zero Forcing Number and Spectral Radius of Graphs.
Electron. J. Comb., 2022
On the sharp bounds of bicyclic graphs regarding edge Szeged index.
Appl. Math. Comput., 2020
On the first reformulated Zagreb indices of graphs with a given clique number.
Ars Comb., 2018
A lower bound of revised Szeged index of bicyclic graphs.
Appl. Math. Comput., 2018
The minimum matching energy of tricyclic graphs and given girth and without K<sub>4</sub>-subdivision.
Ars Comb., 2017
The maximum matching energy of bicyclic graphs with even girth.
Discret. Appl. Math., 2016
On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3.
Discret. Appl. Math., 2015
On the tree with diameter 4 and maximal energy.
Appl. Math. Comput., 2015
The reformulated Zagreb indices of tricyclic graphs.
Appl. Math. Comput., 2015
The Extremal Matching Energy of Graphs.
Ars Comb., 2014