A set S of vertices in a graph G(V,E) is called a dominating set if every vertex v âˆˆ V is either an element of S or is adjacent to an element of S. A set S of vertices in a graph G(V,E) is called a total dominating set if every vertex v âˆˆ V is adjacent to an element of S. The domination number of a graph G denoted by Î³(G) is the minimum cardinality of aâ€¦ (More)

A nonnegative signed dominating function (NNSDF) of a graph G is a function f from the vertex set V (G) to the set {âˆ’1, 1} such that âˆ‘ uâˆˆN [v] f(u) â‰¥ 0 for every vertex v âˆˆ V (G). The nonnegative signed domination number of G, denoted by Î³ s (G), is the minimum weight of a nonnegative signed dominating function on G. In this paper, we establish some sharpâ€¦ (More)

Proceedings of the National Academy of Sciencesâ€¦

2016

Persistence and efficacy of four Iranian diatomaceous earth formulations was assessed against Sitophilus oryzae (L.), Tribolium castaneum (Herbst) and Tribolium confusum Jacquelin du Val. on barley, rice and wheat. Three diatomaceous earth samples were collected from Maragheh, Mamaghan, and Khorasan Jonoobi mines and SayanÂ® formulation was obtained fromâ€¦ (More)