Edge-Neighbor-Rupture Degree of Graphs. - Ersin Aslan (J. Appl. Math., 2013)

The Average Lower Connectivity of Graphs. - Ersin Aslan (J. Appl. Math., 2014)

Neighbor Isolated Tenacity of Graphs. - Ersin Aslan (RAIRO Theor. Informatics Appl., 2015)

A numerical approach with error estimation to solve general integro-differential-difference equations using Dickson polynomials. - Ömür Kivanç Kürkçü; Ersin Aslan; Mehmet Sezer (Appl. Math. Comput., 2016)

Multi-level reranking approach for bug localization. - Deniz Kilinç; Fatih Yücalar; Emin Borandag; Ersin Aslan (Expert Syst. J. Knowl. Eng., 2016)

Weak-Rupture Degree of Graphs. - Ersin Aslan (Int. J. Found. Comput. Sci., 2016)

The average scattering number of graphs. - Ersin Aslan; Deniz Kilinç; Fatih Yücalar; Emin Borandag (RAIRO Theor. Informatics Appl., 2016)

The average lower reinforcement number of a graph. - Tufan Turaci; Ersin Aslan (RAIRO Theor. Informatics Appl., 2016)

A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs. - Ömür Kivanç Kürkçü; Ersin Aslan (Int. J. Found. Comput. Sci., 2018)

An inventive numerical method for solving the most general form of integro-differential equations with functional delays and characteristic behavior of orthoexponential residual function. - Ömür Kivanç Kürkçü; Ersin Aslan; Mehmet Sezer (Comput. Appl. Math., 2019)