5 papers · 1 filter
Injective colorings of Sierpiński-like graphs and Kneser graphs
Boštjan Brešar, Sandi Klavžar, Babak Samadi +1
Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic…
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…
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…
Bounds on the nonnegative signed domination number of graphs
Doost Ali Mojdeh, Babak Samadi, Lutz Volkmann
The aim of this work is to investigate the nonnegative signed domination number with emphasis on regular, ()-clique-free graphs and trees. We give lower and upper b…
Some notes on the signed bad number in bipartite graphs
Doost Ali Mojdeh, Babak Samadi
In this paper, we deal with the signed bad number and the negative decision number of graphs. We show that two upper bounds concerning these two parameters for bipartite graphs in…