Pouyeh Sharifani

CoRR, 2023

2021

On square factors and critical factors of <i>k</i>-bonacci words on infinite alphabet.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the k-rainbow domination in graphs with bounded tree-width.

[BibT_eX]

[DOI]

Ali Shakiba

Electron. J. Graph Theory Appl., 2021

Characterizing extremal graphs for open neighbourhood location-domination.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Some Properties of the $k$-bonacci Words on Infinite Alphabet.

[BibT_eX]

[DOI]

Morteza Mohammad Noori

Electron. J. Comb., 2020

An explicit construction of optimal dominating and [1, 2]-dominating sets in grid.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2020

2019

When an optimal dominating set with given constraints exists.

[BibT_eX]

[DOI]

Omid Etesami

Michel Habib

Reza Naserasr

Theor. Comput. Sci., 2019

Domination cover number of graphs.

[BibT_eX]

[DOI]

Ali Shakiba

Discret. Math. Algorithms Appl., 2019

2017

An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs.

[BibT_eX]

[DOI]

M. Rajaati

Ali Shakiba

Michael J. Dinneen

CoRR, 2017

Some Results on [1, k]-sets of Lexicographic Products of Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

An Explicit Construction of Optimal Dominating Sets in Grid.

[BibT_eX]

[DOI]

CoRR, 2017

A Linear Algorithm for Computing γ<sub>[1,2]</sub>-set in Generalized Series-Parallel Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2011

On z-factorization and c-factorization of standard episturmian words.

[BibT_eX]

[DOI]

Morteza Mohammad Noori