#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2009

2018

- This year (1)
- Last 5 years (10)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- A. H. Mehrnam, A. Motei Nasrabadi, Ali Mohammadian, Sh. Torabi
- 2011 18th Iranian Conference of Biomedicalâ€¦
- 2011

In this study we have used Recurrence Plots (RPs) in order to discriminate between guilty and innocent subjects, using their single-trial ERPs. Data were recorded during the Guilty Knowledge Testâ€¦ (More)

Let k be a natural number and let G be a graph with at least k vertices. A.E. Brouwer conjectured that the sum of the k largest Laplacian eigenvalues of G is at most e(G)+ ( k+1 2 ) , where e(G) isâ€¦ (More)

In this paper, we investigate connected nonregular graphs with four distinct Laplacian eigenvalues. We characterize all such graphs which are bipartite or have exactly one multiple Laplacianâ€¦ (More)

- Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie
- Journal of Graph Theory
- 2012

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Recently, CsikvÃ¡ri proved the existence of integral trees of any even diameter. In the odd case,â€¦ (More)

- Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie
- Discrete Mathematics
- 2016

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It isâ€¦ (More)

- A. H. Mehrnam, Ali Motie Nasrabadi, Mahrad Ghodousi, Ali Mohammadian, Sh. Torabi
- International journal of psychophysiologyâ€¦
- 2017

The purpose of this study is to extend a feature set with non-linear features to improve classification rate of guilty and innocent subjects. Non-linear features can provide extra information aboutâ€¦ (More)

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Integral graphs are very rare and difficult to find. In this paper, we introduce some generalâ€¦ (More)

- Ali Mohammadian, Behruz Tayfeh-Rezaie
- SIAM J. Discrete Math.
- 2014

The existence of a partial quadrangle PQ(s, t, Î¼) is equivalent to the existence of a diamond-free strongly regular graph SRG(1+s(t+1)+s2t(t+1)/Î¼, s(t+1), sâˆ’1, Î¼). Recently, it is shown that thereâ€¦ (More)

- Ali Mohammadian, Behruz Tayfeh-Rezaie
- Eur. J. Comb.
- 2010

Let a graph Î“ be locally disjoint union of three copies of complete graphs Kqâˆ’1 and let Î“ be cospectral with the Hamming graph H(3, q). Bang and Koolen [Asian-Eur. J. Math. 1 (2008), 147â€“156] provedâ€¦ (More)

- Omran Ahmadi, Ali Mohammadian
- Finite Fields and Their Applications
- 2016

Let n be a positive integer and B be a non-degenerate symmetric bilinear form over Fq , where q is an odd prime power and Fq is the finite field with q elements. We determine the largest possibleâ€¦ (More)