Iterative algorithm for computing irregularity strength of complete graph. - Muhammad Ahsan Asim; Ali Ahmad 003; Roslan Hasni (Ars Comb., 2018)

On the edge irregularity strength of disjoint union of star graph and subdivision of star graph. - Ibrahim Tarawneh; Roslan Hasni; Muhammad Ahsan Asim (Ars Comb., 2018)

Polynomials of Degree-Based Indices for Swapped Networks Modeled by Optical Transpose Interconnection System. - Ali Ahmad 003; Roslan Hasni; Kashif Elahi; Muhammad Ahsan Asim (IEEE Access, 2020)

Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs. - Ali Ahmad 003; Muhammad Ahsan Asim; Basem Assiri; Andrea Semanicová-Fenovcíková (Fundam. Informaticae, 2020)

Computation of Vertex-Edge Degree Based Topological Descriptors for Metal Trihalides Network. - Fouad A. Abolaban; Ali Ahmad 003; Muhammad Ahsan Asim (IEEE Access, 2021)

Irregularity Strength of Circulant Graphs Using Algorithmic Approach. - Muhammad Ahsan Asim; Roslan Hasni; Ali Ahmad 003; Basem Assiri; Andrea Semanicová-Fenovcíková (IEEE Access, 2021)

On Vertex-Edge-Degree Topological Descriptors for Certain Crystal Networks. - Sadia Husain; Fouad A. Abolaban; Ali Ahmad 003; Muhammad Ahsan Asim; Yasir Ahmad (Comput. Syst. Sci. Eng., 2022)

Computing Edge Irregularity Strength of Star and Banana Trees Using Algorithmic Approach. - Muhammad Shahzad; Muhammad Ahsan Asim; Roslan Hasni; Ali Ahmad 003 (Ars Comb., 2024)