Výsledky vyhledávání

Akademický článek

Autor: Mojdeh Doost Ali, Musawi S.R., Nazari E.

Publikováno v: Open Mathematics, Vol 16, Iss 1, Pp 816-825 (2018)

A subset D of vertices of a graph G is a dominating set if for each u ∈ V(G) ∖ D, u is adjacent to some vertex v ∈ D. The domination number, γ(G) of G, is the minimum cardinality of a dominating set of G. For an even integer n ≥ 2 and 1 ≤

Externí odkaz: https://doaj.org/article/23fb2bee4c4e4f23ba9ef114479cf77e

Zobrazit plný text záznamu

Report

The dual of z-submodules of modules and some of extensions

Autor: Farshadifar, F., Molkhasi, A., Nazari, E.

Let R be a commutative ring with identity and M be an R-module. The purpose of this paper is to introduced the dual notion of z-submodules of M and some of extensions. Moreover, we investigate some properties of these classes of modules when M is a c

Externí odkaz: http://arxiv.org/abs/2309.09259

Zobrazit plný text záznamu

Report

On the distance domination number of bipartite graphs

Autor: Mojdeh, D. A., Musawi, S. R., Nazari, E.

A subset $D\subseteq V(G)$ is called a $k$-distance dominating set of $G$ if every vertex in $V(G)\setminus D$ is within distance $k$ from some vertex of $D$. The minimum cardinality among all $k$-distance dominating sets of $G$ is called the $k$-dis

Externí odkaz: http://arxiv.org/abs/1805.01280

Zobrazit plný text záznamu

Report

Domination Critical Knodel Graphs

Autor: Mojdeh, D. A., Musawi, S. R., Nazari, E.

A set $D$ of vertices of a graph $G$ is a dominating set if each vertex of $V(G)\setminus D$ is adjacent to some vertex of $D$. The domination number of $G$, $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. A graph $G$ is called do

Externí odkaz: http://arxiv.org/abs/1805.01464

Zobrazit plný text záznamu