default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad J. Nadjafi-Arani
Person information
- affiliation: Mahallat Institute of Higher Education, Faculty of Science, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Mohammad Javad Nadjafi-Arani
, Saeed Doostali, Mohamed F. Younis:
Workflow Scheduling With Guaranteed Responsiveness and Minimal Cost. IEEE Trans. Serv. Comput. 16(4): 3075-3087 (2023)- 2020
- [j19]Mohammad Javad Nadjafi-Arani, Mahsa Mirzargar, Frank Emmert-Streib, Matthias Dehmer:
Partition and Colored Distances in Graphs Induced to Subsets of Vertices and Some of Its Applications. Symmetry 12(12): 2027 (2020)
2010 – 2019
- 2019
- [j18]Mohammad Khalily Dermany, Mohammad J. Nadjafi-Arani, S. Doostali:
Combining topology control and network coding to optimize lifetime in wireless-sensor networks. Comput. Networks 162 (2019) - [j17]Mohammad Khalily Dermany, Mohammad J. Nadjafi-Arani:
Mathematical Aspects in Combining Network Coding With Transmission Range Adjustment. IEEE Commun. Lett. 23(9): 1568-1571 (2019) - 2017
- [j16]Mohammad Khalily Dermany, Mostafa Shamsi, Mohammad J. Nadjafi-Arani:
A convex optimization model for topology control in network-coding-based-wireless-sensor networks. Ad Hoc Networks 59: 1-11 (2017) - [j15]Mohammad Khalily Dermany, Mohammad J. Nadjafi-Arani:
Itinerary planning for mobile sinks in network-coding-based wireless sensor networks. Comput. Commun. 111: 1-13 (2017) - [j14]Kinkar Chandra Das, Mohammad J. Nadjafi-Arani:
On maximum Wiener index of trees and graphs with given radius. J. Comb. Optim. 34(2): 574-587 (2017) - 2016
- [j13]Sandi Klavzar, Paul D. Manuel, Mohammad J. Nadjafi-Arani, R. Sundara Rajan, Cyriac Grigorious, Sudeep Stephen:
Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs. Comput. J. 59(12): 1900-1910 (2016) - [j12]Mohammad J. Nadjafi-Arani, Mark H. Siggers, Hossein Soltani:
Characterisation of forests with trivial game domination numbers. J. Comb. Optim. 32(3): 800-811 (2016) - 2015
- [j11]Kinkar Chandra Das, Ivan Gutman, Mohammad J. Nadjafi-Arani:
Relations between distance-based and degree-based topological indices. Appl. Math. Comput. 270: 142-147 (2015) - [j10]Kinkar Chandra Das, Mohammad J. Nadjafi-Arani:
Comparison between the Szeged index and the eccentric connectivity index. Discret. Appl. Math. 186: 74-86 (2015) - 2014
- [j9]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Computing distance moments on graphs with transitive Djoković-Winkler relation. Discret. Appl. Math. 166: 269-272 (2014) - [j8]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
On the difference between the revised Szeged index and the Wiener index. Discret. Math. 333: 28-34 (2014) - [j7]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Wiener index in weighted graphs via unification of Θ∗Θ∗-classes. Eur. J. Comb. 36: 71-76 (2014) - [j6]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Improved bounds on the difference between the Szeged index and the Wiener index of graphs. Eur. J. Comb. 39: 148-156 (2014) - [j5]Mohammad J. Nadjafi-Arani, Sandi Klavzar:
Cut method and Djoković-Winkler's relation. Electron. Notes Discret. Math. 45: 153-157 (2014) - 2013
- [j4]Sandi Klavzar, Mohammad J. Nadjafi-Arani:
Wiener index versus Szeged index in networks. Discret. Appl. Math. 161(7-8): 1150-1153 (2013) - 2012
- [j3]Mohammad J. Nadjafi-Arani, H. Khodashenas, Ali Reza Ashrafi:
Graphs whose Szeged and Wiener numbers differ by 4 and 5. Math. Comput. Model. 55(3-4): 1644-1648 (2012) - 2011
- [j2]Mohammad J. Nadjafi-Arani, H. Khodashenas, A. R. Ashrafi:
On the differences between Szeged and Wiener indices of graphs. Discret. Math. 311(20): 2233-2237 (2011)
2000 – 2009
- 2009
- [j1]Mohammad J. Nadjafi-Arani, Gholam Hossein Fath-Tabar, A. R. Ashrafi:
Extremal graphs with respect to the vertex PI index. Appl. Math. Lett. 22(12): 1838-1840 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
