default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFreydoon Rahbarnia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j15]Ali Ghalavand
, Sandi Klavzar, Mostafa Tavakoli, Mardjan Hakimi-Nezhaad, Freydoon Rahbarnia:
Leap eccentric connectivity index in graphs with universal vertices. Appl. Math. Comput. 436: 127519 (2023)- [j14]Ghazale Ghazi, Freydoon Rahbarnia, Mostafa Tavakoli:
Star chromatic number of some graph products. Discret. Math. Algorithms Appl. 15(8): 2250178:1-2250178:12 (2023) - 2021
- [j13]Sandi Klavzar, Freydoon Rahbarnia, Mostafa Tavakoli:
Some binary products and integer linear programming for k-metric dimension of graphs. Appl. Math. Comput. 409: 126420 (2021) - [j12]Samane Bakaein, Mostafa Tavakoli, Freydoon Rahbarnia:
Perfect codes in some products of graphs. Electron. J. Graph Theory Appl. 9(1): 175-184 (2021) - 2020
- [j11]Ghazale Ghazi, Freydoon Rahbarnia, Mostafa Tavakoli:
2-Distance chromatic number of some graph products. Discret. Math. Algorithms Appl. 12(02): 2050021 (2020) - [j10]Mohammad Eshaghnezhad, Sohrab Effati, Freydoon Rahbarnia:
Projection Recurrent Neural Network Model: A New Strategy to Solve Maximum Flow Problem. IEEE Trans. Circuits Syst. 67-II(11): 2747-2751 (2020) - 2019
- [j9]Gholamreza Abrishami, Freydoon Rahbarnia:
A note on the smallest connected non-traceable cubic bipartite planar graph. Discret. Math. 342(8): 2384-2392 (2019) - [j8]Gholamreza Abrishami, Michael A. Henning, Freydoon Rahbarnia:
On independent domination in planar, cubic graphs. Discuss. Math. Graph Theory 39(4): 841-853 (2019) - [j7]Mohammad Eshaghnezhad, Freydoon Rahbarnia, Sohrab Effati, Amin Mansoori:
An Artificial Neural Network Model to Solve the Fuzzy Shortest Path Problem. Neural Process. Lett. 50(2): 1527-1548 (2019) - 2018
- [j6]Hamid Reza Barani, Kazem Khashyarmanesh, Freydoon Rahbarnia:
On The Generalized Cayley Graphs Of Power Set Rings And Hamiltonian Cycles. Ars Comb. 138: 365-380 (2018) - [j5]Gholamreza Abrishami, Freydoon Rahbarnia:
Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs. Inf. Process. Lett. 140: 25-29 (2018) - 2015
- [j4]Morteza Jafarzadeh, Hamed Reza Tareghian, Freydoon Rahbarnia, Reza Ghanbari:
Optimal selection of project portfolios using reinvestment strategy within a flexible time horizon. Eur. J. Oper. Res. 243(2): 658-664 (2015) - [j3]Ali Reza Sepasian, Freydoon Rahbarnia:
Upgrading p-Median Problem on a Path. J. Math. Model. Algorithms Oper. Res. 14(2): 145-157 (2015) - 2013
- [j2]Mostafa Tavakoli, Freydoon Rahbarnia, Ali Reza Ashrafi:
Distribution of some graph invariants over hierarchical product of graphs. Appl. Math. Comput. 220: 405-413 (2013) - [j1]Mostafa Tavakoli, Freydoon Rahbarnia, A. R. Ashrafi:
Further results on hierarchical product of graphs. Discret. Appl. Math. 161(7-8): 1162-1167 (2013)
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-10-07 22:15 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:
