activity
20102021
most citedOn square factors and critical factors of -bonacci words on infinite alphabet

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

collaborators

7 papers

cs.DM2021

Generalized Gapped-kmer Filters for Robust Frequency Estimation

Morteza Mohammad-Noori, Narges Ghareghani, Mahmood Ghandi

In this paper, we study the generalized gapped k-mer filters and derive a closed form solution for their coefficients. We consider nonnegative integers and , with $k\leq…

math.CO20191 cited

On square factors and critical factors of -bonacci words on infinite alphabet

Narges Ghareghani, Pouyeh Sharifani

For any integer , the infinite -bonacci word , on the infinite alphabet is defined as the fixed point of the morphism $φ_k:\mathbb{N}\rightarrow \mathbb{N}^2 \cup…

math.CO2019

A note on bipartite graphs whose [1, k]-domination number equal to their number of vertices

Narges Ghareghani, Iztok Peterin, Pouyeh Sharifani

A subset of the vertex set of a graph is called an -dominating set if every vertex from is adjacent to at least one vertex and at most vertices of .…

math.CO2019

Some properties of -bonacci words on infinite alphabet

Narges Ghareghani, Pouyeh Sharifani, Morteza Mohammad-Noori

The Fibonacci word on an infinite alphabet was introduced in [Zhang et al., Electronic J. Combinatorics 2017 24(2), 2-52] as a fixed point of the morphism $2i\rightarrow (2i)(2…

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 , where 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 with is regular. Also we define notion of distance-balanced closure of a graph and we find distance-…