default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Mohammadian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Makoto Araya, Masaaki Harada, Hadi Kharaghani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
On the classification of skew Hadamard matrices of order $\varvec{36}$ and related structures. Des. Codes Cryptogr. 92(10): 3049-3062 (2024)- [j16]Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie:
The weak saturation number of K2,. Discret. Math. 347(9): 114078 (2024) - 2022
- [j15]Ali Mohammadian:
On the forcing matching numbers of prisms of graphs. Discret. Math. 345(4): 112756 (2022) - 2021
- [j14]Amélia Fonseca
, Ângela Mestre, Ali Mohammadian, Cecília Perdigão, Maria Manuel Torres:
The maximum number of Parter vertices of acyclic matrices. Discret. Math. 344(2): 112198 (2021) - [j13]Mohammadreza Bidgoli, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs. Eur. J. Comb. 92: 103256 (2021) - [j12]Mohammadreza Bidgoli, Ali Mohammadian, Behruz Tayfeh-Rezaie:
On K2, t-Bootstrap Percolation. Graphs Comb. 37(3): 731-741 (2021)
2010 – 2019
- 2018
- [j11]Ali Mohammadian, Behruz Tayfeh-Rezaie:
Star saturation number of random graphs. Discret. Math. 341(4): 1166-1170 (2018) - 2016
- [j10]Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Integral trees with given nullity. Discret. Math. 339(1): 157-164 (2016) - [j9]Ali Mohammadian:
A generalization of the odd-girth theorem. Discret. Math. 339(2): 1052-1057 (2016) - [j8]Ali Mohammadian, Vilmar Trevisan:
Some spectral properties of cographs. Discret. Math. 339(4): 1261-1264 (2016) - [j7]Omran Ahmadi, Ali Mohammadian:
Sets with many pairs of orthogonal vectors over finite fields. Finite Fields Their Appl. 37: 179-192 (2016) - 2015
- [j6]Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
On order and rank of graphs. Comb. 35(6): 655-668 (2015) - [j5]Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Maximum Order of Triangle-Free Graphs with a Given Rank. J. Graph Theory 79(2): 145-158 (2015) - 2014
- [j4]Ali Mohammadian, Behruz Tayfeh-Rezaie:
On a Family of Diamond-Free Strongly Regular Graphs. SIAM J. Discret. Math. 28(4): 1906-1915 (2014) - 2012
- [j3]Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Maximum order of trees and bipartite graphs with a given rank. Discret. Math. 312(24): 3498-3501 (2012) - [j2]Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Integral trees of odd diameters. J. Graph Theory 70(3): 332-338 (2012) - [i1]Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
On Order and Rank of Graphs. CoRR abs/1201.3060 (2012) - 2010
- [j1]Ali Mohammadian, Behruz Tayfeh-Rezaie:
A short proof of a theorem of Bang and Koolen. Eur. J. Comb. 31(5): 1461-1463 (2010)
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-02 20:39 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:
