Doost Ali Mojdeh

Discret. Math. Algorithms Appl., February, 2024

Outer independent double Italian domination: Complexity, characterization.

[BibT_eX]

[DOI]

R. Jalaei

,

Discret. Math. Algorithms Appl., April, 2023

Further results on 2-distance coloring of graphs.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2023

Total 2-domination number in digraphs and its dual parameter.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2023

Global offensive k-alliances in digraphs.

[BibT_eX]

[DOI]

,

,

Bull. ICA, 2023

Restrained condition on double Roman dominating functions.

[BibT_eX]

[DOI]

Hossein Abdollahzadeh Ahangar

,

Nasrin Soltankhah

,

,

,

Seyed Mahmoud Sheikholeslami

,

,

Juan Carlos Valenzuela Tripodoro

Appl. Math. Comput., 2023

On the conjectures of neighbor locating coloring of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Restrained double Roman domination of a graph.

[BibT_eX]

[DOI]

,

Iman Masoumi

,

RAIRO Oper. Res., 2022

Further results on packing related parameters in graphs.

[BibT_eX]

[DOI]

,

,

Discuss. Math. Graph Theory, 2022

Restrained Italian domination in graphs.

[BibT_eX]

[DOI]

,

,

,

RAIRO Oper. Res., 2021

Unique response strong Roman dominating functions of graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Graph Theory Appl., 2021

On three outer-independent domination related parameters in graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2021

Covering Italian domination in graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2021

Total Roman {3}-domination in Graphs.

[BibT_eX]

[DOI]

Zehui Shao

,

,

Symmetry, 2020

Global defensive <i>k</i>-alliances in directed graphs: combinatorial and computational issues.

[BibT_eX]

[DOI]

,

,

RAIRO Oper. Res., 2020

On the distance domination number of bipartite graphs.

[BibT_eX]

[DOI]

,

Seyed Reza Musawi

,

Esmaeil Nazari

Electron. J. Graph Theory Appl., 2020

(Open) packing number of some graph products.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Theor. Comput. Sci., 2020

Roman 2-bondage number of a graph.

[BibT_eX]

[DOI]

,

Ahmad Moradi

,

Omid Sharifi

Discuss. Math. Graph Theory, 2020

Addendum: "The signed bad numbers in graphs".

[BibT_eX]

[DOI]

,

Discret. Math. Algorithms Appl., 2020

Roman {3}-domination (double Italian domination).

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2020

Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs.

[BibT_eX]

[DOI]

,

,

Contributions Discret. Math., 2020

Packing parameters in graphs: new bounds and a solution to an open problem.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2019

Outer independent global dominating set of trees and unicyclic graphs.

[BibT_eX]

[DOI]

,

Morteza Alishahi

Electron. J. Graph Theory Appl., 2019

Packing and domination parameters in digraphs.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2019

Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination.

[BibT_eX]

[DOI]

,

,

,

IEEE Access, 2019

New bound on MIS and MIN-CDS for a unit ball graph.

[BibT_eX]

[DOI]

,

M. Ghanbari

,

M. Ramezani

ICT Express, 2017

On the signed 2-independence number of graphs.

[BibT_eX]

[DOI]

S. M. Hosseini Moghaddam

,

,

,

Electron. J. Graph Theory Appl., 2017

Tetracyclic graphs with maximal Estrada index.

[BibT_eX]

[DOI]

,

Akbar Jahanbani

,

Discret. Math. Algorithms Appl., 2017

New and improved results on the signed (total) k-domination number of graphs.

[BibT_eX]

[DOI]

,

Discret. Math. Algorithms Appl., 2017

Limited packing vs tuple domination in graphs.

[BibT_eX]

,

Seyyed Mehdi Hosseini Moghaddam

,

S. M. Hosseini Moghaddam

Ars Comb., 2017

New bounds on the signed total domination number of graphs.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2016

Various bounds for liar's domination number.

[BibT_eX]

[DOI]

Abdollah Alimadadi

,

,

Discuss. Math. Graph Theory, 2016

Liar's dominating sets in graphs.

[BibT_eX]

[DOI]

Abdollah Alimadadi

,

,

Discret. Appl. Math., 2016

Neighborhood total domination of a graph and its complement.

[BibT_eX]

[DOI]

,

M. R. Sayed Salehi

,

Australas. J Comb., 2016

Trees with the same global domination number as their square.

[BibT_eX]

[DOI]

,

Morteza Alishahi

,

Australas. J Comb., 2016

On questions on (total) domination vertex critical graphs.

[BibT_eX]

,

Roslan Hasni

Ars Comb., 2010

On connected (γ, k)-critical graphs.

[BibT_eX]

[DOI]

,

P. Firoozi

,

Roslan Hasni

Australas. J Comb., 2010

Defining numbers in some of the Harary graphs.

[BibT_eX]

[DOI]

,

Adel P. Kazemi

Appl. Math. Lett., 2009

Graphs K1*4, 5, K1*5, 4, K1*4, 4, K2, 3, 4, have the property M(3).

[BibT_eX]

Hossein Abdollahzadeh Ahangar

,

A. Ahmadi Haji

,

,

Abdollah Khodkar

Ars Comb., 2007

On the total domination critical graphs.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2006

Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph.

[BibT_eX]

[DOI]

Doostali Mojdeh

Discuss. Math. Graph Theory, 2006

The defining numbers for vertex colorings of certain graphs.

[BibT_eX]

[DOI]

,