10 citations · 14 across the 12 of their papers we have counts for
13 papers
Enumeration of Factor Occurrences in -Bonacci Words over an Infinite Alphabet
Narges Ghareghani, Mehdi Golafshan, Morteza Mohammad-Noori +1
We study the -Bonacci word over the infinite alphabet . Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information.…
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
Florent Foucaud, Narges Ghareghani, Lucas Lorieau +3
In the GEODETIC SET problem, an input is a (di)graph and integer , and the objective is to decide whether there exists a vertex subset of size such that any vertex i…
Extremal digraphs for open neighbourhood location-domination and identifying codes
Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani
A set of vertices of a digraph is called an open neighbourhood locating-dominating set if every vertex in has an in-neighbour in , and for every pair of vertic…
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…
Characterizing extremal graphs for open neighbourhood location-domination
Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi +1
An open neighbourhood locating-dominating set is a set of vertices of a graph such that each vertex of has a neighbour in , and for any two vertices of , th…
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…
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 .…
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…
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…
A note on zero-sum 5-flows in regular graphs
S. Akbari, N. Ghareghani, G. B. Khosrovshahi +1
Let be a graph. A zero-sum flow in is an assignment of nonzero real number to the edges such that the sum of the values of all edges incident with each vertex is zero. Let…
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-…
On z-factorization and c-factorization of standard episturmian words
M. Mohammad-Nooria, N. Ghareghanib, P. Sharifani
Ziv-Lempel and Crochemore factorization are two kinds of factorizations of words related to text processing. In this paper, we find these factorizations for standard epiesturmian w…
Intersection matrices revisited
N. Ghareghani, E. Ghorbani, M. Mohammad-Noori
Several intersection matrices of -subsets vs. -subsets of a -set are introduced in the literature. We study these matrices systematically through counting arguments and ge…