10 citations · 13 across the 10 of their papers we have counts for
6 papers · 1 filter
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.…
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…
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…