M. Mohammad-Noori

activity

20092026

most citedEnumeration of closed random walks in the square lattice according to their areas

1 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

Enumeration of Factor Occurrences in $k$ -Bonacci Words over an Infinite Alphabet

Narges Ghareghani, Mehdi Golafshan, Morteza Mohammad-Noori +1

We study the $k$ -Bonacci word over the infinite alphabet $N$ . Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information.…

math.CO2016

Some Results and Connections of an Eigendecomposition Problem

M. Mohammad-Noori, N. Ghareghani, M. Ghandi

We consider the problem of finding nonzero eigenvalues and the corresponding eigenvectors of a matrix $A A^{⊤}$ , where $A$ is a special incidence matrix; This matrix can equivale…

math.CO2010

Distance-balanced closure of some graphs

N. Ghareghani, B. Manouchehrian, M. Mohammad-Noori

In this paper we prove that any distance-balanced graph $G$ with $Δ (G) \geq ∣ V (G) ∣ - 3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-…

math.CO2010★ 1 cited

Enumeration of closed random walks in the square lattice according to their areas

Morteza Mohammad-Noori

We study the area distribution of closed walks of length $n$ , beginning and ending at the origin. The concept of area of a walk in the square lattice is generalized and the usefuln…

math.CO2009★ 1 cited

Intersection matrices revisited

N. Ghareghani, E. Ghorbani, M. Mohammad-Noori

Several intersection matrices of $s$ -subsets vs. $k$ -subsets of a $v$ -set are introduced in the literature. We study these matrices systematically through counting arguments and ge…