activity
20152026
most citedOn three outer-independent domination related parameters in graphs

16 citations · 73 across the 33 of their papers we have counts for

collaborators
Showing 2019Show all

8 papers · 1 filter

math.CO2019

Total vertex product irregularity strength of graphs

Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh

Consider a simple graph . We call a labeling (\textit{total vertex}) \textit{product-irregular}, if all product degrees …

math.CO2019

On the upper Bound of double Roman dominating function

Atieh Teimourzadeh, Doost Ali Mojdeh

A double Roman Dominating function on a graph is a function such that the following conditions hold. If , then vertex must have at lea…

math.CO2019

The Laplacian eigenvalue 2 of bicyclic graphs

Doost Ali Mojdeh, Mohammad Habibi, Masoumeh Farkhondeh

If is a graph, its Laplacian is the difference between diagonal matrix of its vertex degrees and its adjacency matrix. A one-edge connection of two graphs and i…

math.GM2019★ 12 cited

Outer independent double Roman domination number of graphs

Doost Ali Mojdeh, Babak Samadi, Zehui Shao +1

A double Roman dominating function of a graph is a function having the property that for each vertex with , there exists …

math.CO2019★ 1 cited

Double domination and total -domination in digraphs and their dual problems

Doost Ali Mojdeh, Babak Samadi

A subset of vertices of a digraph is a double dominating set (total -dominating set) if every vertex not in is adjacent from at least two vertices in , and every…

math.CO2019★ 1 cited

Global offensive -alliances in digraphs

Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero

In this paper, we initiate the study of global offensive -alliances in digraphs. Given a digraph , a global offensive -alliance in a digraph is a subset $S…