Extremal graphs with respect to the vertex PI index. - Mohammad J. Nadjafi-Arani; Gholam Hossein Fath-Tabar; A. R. Ashrafi (Appl. Math. Lett., 2009)

On the differences between Szeged and Wiener indices of graphs. - Mohammad J. Nadjafi-Arani; H. Khodashenas; A. R. Ashrafi (Discret. Math., 2011)

Graphs whose Szeged and Wiener numbers differ by 4 and 5. - Mohammad J. Nadjafi-Arani; H. Khodashenas; Ali Reza Ashrafi (Math. Comput. Model., 2012)

Wiener index versus Szeged index in networks. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Discret. Appl. Math., 2013)

Computing distance moments on graphs with transitive Djoković-Winkler relation. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Discret. Appl. Math., 2014)

On the difference between the revised Szeged index and the Wiener index. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Discret. Math., 2014)

Wiener index in weighted graphs via unification of Θ∗Θ∗-classes. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Eur. J. Comb., 2014)

Improved bounds on the difference between the Szeged index and the Wiener index of graphs. - Sandi Klavzar; Mohammad J. Nadjafi-Arani (Eur. J. Comb., 2014)

Cut method and Djoković-Winkler's relation. - Mohammad J. Nadjafi-Arani; Sandi Klavzar (Electron. Notes Discret. Math., 2014)

Relations between distance-based and degree-based topological indices. - Kinkar Chandra Das; Ivan Gutman; Mohammad J. Nadjafi-Arani (Appl. Math. Comput., 2015)

Comparison between the Szeged index and the eccentric connectivity index. - Kinkar Chandra Das; Mohammad J. Nadjafi-Arani (Discret. Appl. Math., 2015)

Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs. - Sandi Klavzar; Paul D. Manuel; Mohammad J. Nadjafi-Arani; R. Sundara Rajan; Cyriac Grigorious; Sudeep Stephen (Comput. J., 2016)

Characterisation of forests with trivial game domination numbers. - Mohammad J. Nadjafi-Arani; Mark H. Siggers; Hossein Soltani (J. Comb. Optim., 2016)

A convex optimization model for topology control in network-coding-based-wireless-sensor networks. - Mohammad Khalily Dermany; Mostafa Shamsi; Mohammad J. Nadjafi-Arani (Ad Hoc Networks, 2017)

Itinerary planning for mobile sinks in network-coding-based wireless sensor networks. - Mohammad Khalily Dermany; Mohammad J. Nadjafi-Arani (Comput. Commun., 2017)

On maximum Wiener index of trees and graphs with given radius. - Kinkar Chandra Das; Mohammad J. Nadjafi-Arani (J. Comb. Optim., 2017)

Combining topology control and network coding to optimize lifetime in wireless-sensor networks. - Mohammad Khalily Dermany; Mohammad J. Nadjafi-Arani; S. Doostali (Comput. Networks, 2019)

Mathematical Aspects in Combining Network Coding With Transmission Range Adjustment. - Mohammad Khalily Dermany; Mohammad J. Nadjafi-Arani (IEEE Commun. Lett., 2019)

Partition and Colored Distances in Graphs Induced to Subsets of Vertices and Some of Its Applications. - Mohammad Javad Nadjafi-Arani; Mahsa Mirzargar; Frank Emmert-Streib; Matthias Dehmer (Symmetry, 2020)

Workflow Scheduling With Guaranteed Responsiveness and Minimal Cost. - Mohammad Javad Nadjafi-Arani; Saeed Doostali; Mohamed F. Younis (IEEE Trans. Serv. Comput., 2023)

Linear to Neural Networks Regression: QSPR of Drugs via Degree-Distance Indices. - Mohammad J. Nadjafi-Arani; Sezer Sorgun; Mahsa Mirzargar (CoRR, 2025)