N. Ghareghani

activity

20092026

most citedCharacterizing extremal graphs for open neighbourhood location-domination

10 citations · 14 across the 12 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019★ 1 cited

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

Narges Ghareghani, Pouyeh Sharifani

For any integer $k > 2$ , the infinite $k$ -bonacci word $W^{(k)}$ , 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 $D$ of the vertex set $V$ of a graph $G$ is called an $[1, k]$ -dominating set if every vertex from $V - D$ is adjacent to at least one vertex and at most $k$ vertices of $D$ .…

math.CO2019

Some properties of $k$ -bonacci words on infinite alphabet

Narges Ghareghani, Pouyeh Sharifani, Morteza Mohammad-Noori

The Fibonacci word $W$ 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…

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

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

Some properties of k-bonacci words on infinite alphabet

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

Some properties of $k$ -bonacci words on infinite alphabet