collaborators

12 papers

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.CO2019

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

Independent double Roman domination in graphs

Doost Ali Mojdeh, Zhila Mansouri

An independent double Roman dominating function (IDRDF) on a graph is a function having the property that if , then the vertex

math.CO2018

On three outer-independent domination related parameters in graphs

Doost Ali Mojdeh, Iztok Peterin, Babak Samadi +1

Let be a graph and let . The set is a double outer-independent dominating set of if , for all , and is…