Follow
pouyeh sharifani
pouyeh sharifani
Computer Science
Verified email at khayam.ut.ac.ir
Title
Cited by
Cited by
Year
Characterizing extremal graphs for open neighbourhood location-domination
F Foucaud, N Ghareghani, A Roshany-Tabrizi, P Sharifani
Discrete Applied Mathematics 302, 76-79, 2021
102021
When an optimal dominating set with given constraints exists
O Etesami, N Ghareghani, M Habib, M Hooshmandasl, R Naserasr, ...
Theoretical Computer Science 780, 54-65, 2019
92019
On z-factorization and c-factorization of standard episturmian words
N Ghareghani, M Mohammad-Noori, P Sharifani
Theoretical computer science 412 (39), 5232-5238, 2011
82011
Some properties of -bonacci words on infinite alphabet
N Ghareghani, P Sharifani, M Mohammad-Noori
arXiv preprint arXiv:1911.12416, 2019
72019
[1, k]-Domination Number of Lexicographic Products of Graphs
N Ghareghani, I Peterin, P Sharifani
Bulletin of the Malaysian Mathematical Sciences Society 44, 375-392, 2021
52021
On square factors and critical factors of k-bonacci words on infinite alphabet
N Ghareghani, P Sharifani
Theoretical Computer Science 865, 34-43, 2021
32021
A note on bipartite graphs whose [1, k]-domination number equal to their number of vertices
N Ghareghani, I Peterin, P Sharifani
arXiv preprint arXiv:1912.03919, 2019
32019
On the k-rainbow domination in graphs with bounded tree-width.
MA Meybodi, MR Hooshmandasl, P Sharifani, A Shakiba
Electron. J. Graph Theory Appl. 9 (2), 277-300, 2021
22021
An explicit construction of optimal dominating and [1, 2]–dominating sets in grid
P Sharifani, MR Hooshmandasl, M Alambardar Meybodi
AKCE International Journal of Graphs and Combinatorics 17 (3), 870-876, 2020
22020
Extremal digraphs for open neighbourhood location-domination and identifying codes
F Foucaud, N Ghareghani, P Sharifani
Discrete Applied Mathematics 347, 62-74, 2024
12024
A linear-time algorithm to compute total -domination number of block graphs
P Sharifani, M Hooshmandasl, S Alikhani
AUT Journal of Mathematics and Computing 1 (2), 263-270, 2020
12020
An efficient algorithm for mixed domination on generalized series-parallel graphs
M Rajaati, P Sharifani, A Shakiba, MR Hooshmandasl, MJ Dinneen
arXiv preprint arXiv:1708.00240, 2017
12017
Some Results on [1, k]-sets of Lexicographic Products of Graphs
P Sharifani, MR Hooshmandasl
arXiv preprint arXiv:1708.00219, 2017
12017
A Linear Algorithm for Computing -set in Generalized Series-Parallel Graphs
P Sharifani, MR Hooshmandasl
arXiv preprint arXiv:1707.06443, 2017
12017
Total [1, k]-Sets in the Lexicographic Product of Graphs.
P Sharifani, MR Hooshmandasl
Journal of Mathematical Extension 13 (3), 2019
2019
When an optimal dominating set with given constraints exists
N Ghareghani, M Habib, MR Hooshmandasl, R Naserasr, P Sharifani
Theoretical Computer Science, 2019
2019
Domination cover number of graphs
MA Meybodi, MR Hooshmandasl, P Sharifani, A Shakiba
Discrete Mathematics, Algorithms and Applications 11 (02), 1950020, 2019
2019
Total [1, k]-sets of lexicographic product graphs with characterization
MR Hooshmandasl, P Sharifani
Journal of Mathematical Extension 13, 57-69, 2019
2019
Domination Cover Number of Graphs
M Alambardar Meybodi, MR Hooshmandasl, P Sharifani, A Shakiba
arXiv e-prints, arXiv: 1805.02345, 2018
2018
An Explicit Construction of Optimal Dominating Sets in Grid
P Sharifani, MR Hooshmandasl, MA Meybodi
arXiv preprint arXiv:1707.06471, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–20