1 citations · 1 across the 5 of their papers we have counts for
8 papers
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…
Domination Cover Number of Graphs
M. Alambardar Meybodi, M. R. Hooshmandasl, P. Sharifani +1
A set for the graph is called a dominating set if any vertex has at least one neighbor in . Fomin et al.[9] gave an algorithm for…
An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs
M. Rajaati, P. Sharifani, A. Shakiba +2
A mixed dominating set of a graph is a subset such that each element is adjacent or incident to at least one ele…
Some Results on [1, k]-sets of Lexicographic Products of Graphs
P. Sharifani, M. R. Hooshmandasl
A subset in a graph is called a -set, if for every vertex , . The -domination numbe…