Zobrazeno 1 - 10
of 69
pro vyhledávání: '"stable graph"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Xiaolong Shi, Pu Wu, Zehui Shao, Vladimir Samodivkin, Seyed Mahmoud Sheikholeslami, M. Soroudi, Shaohui Wang
Publikováno v:
IEEE Access, Vol 7, Pp 72604-72612 (2019)
Domination number is of practical interest in several theoretical and applied scenes. In the problem of wireless networking, the dominating idea is used to deduce an efficient route within the adhoc mobilenetworks. It has also been used for the summa
Externí odkaz:
https://doaj.org/article/e85eae963aaa432785ed105760617f31
Autor:
Manimuthu Yamuna, Kumarasamy Karthika
Publikováno v:
Songklanakarin Journal of Science and Technology (SJST), Vol 40, Iss 2, Pp 333-338 (2018)
Let G1 and G2 be two undirected graphs, (v w) be an edge of G1, and (x y) be an edge of G2. Hajos construction forms a new graph H, that combines the two graphs by identifying vertices v and x into a single vertex, removing the two edges (v w) and
Externí odkaz:
https://doaj.org/article/9e87582e226c43539957fd1afa1bedae
Autor:
Pu Wu, Zehui Shao, Enqiang Zhu, Huiqin Jiang, S. Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami
Publikováno v:
IEEE Access, Vol 6, Pp 74737-74746 (2018)
A Roman dominating function (RDF) on a graph $G$ is a function $f: V(G) \rightarrow \{0, 1, 2\}$ for which every vertex assigned 0 is adjacent to a vertex assigned 2. The weight of an RDF is the value $\omega (f) = \sum _{u \in V(G)}f(u)$ . The minim
Externí odkaz:
https://doaj.org/article/8e1ea457ab904da8aebb52da84ee322a
Autor:
Pu Wu, Huiqin Jiang, Sakineh Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami, Zehui Shao, Lutz Volkmann
Publikováno v:
Mathematics, Vol 7, Iss 9, p 820 (2019)
A set S ⊆ V ( G ) in a graph G is a dominating set if S dominates all vertices in G, where we say a vertex dominates each vertex in its closed neighbourhood. A set is independent if it is pairwise non-adjacent. The minimum cardinality of an indepen
Externí odkaz:
https://doaj.org/article/3ee37176b0ab414eaad8ef6c7e2e3302
Autor:
Mohammad Abudayah, Omar Alomari
Publikováno v:
Mathematics, Vol 7, Iss 7, p 597 (2019)
The independent number of a graph G is the cardinality of the maximum independent set of G, denoted by α ( G ) . The independent dominating number is the cardinality of the smallest independent set that dominates all vertices of G. In this paper, we
Externí odkaz:
https://doaj.org/article/1c01d5e2157d48058482ccfd173a9289
Autor:
Marzieh Soroudi, Vladimir Samodivkin, Pu Wu, Zehui Shao, Xiaolong Shi, Shaohui Wang, Seyed Mahmoud Sheikholeslami
Publikováno v:
IEEE Access, Vol 7, Pp 72604-72612 (2019)
Domination number is of practical interest in several theoretical and applied scenes. In the problem of wireless networking, the dominating idea is used to deduce an efficient route within the adhoc mobilenetworks. It has also been used for the summa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::944372f3489bbdb92828f3592f9f8a5e
https://ieeexplore.ieee.org/document/8726358/
https://ieeexplore.ieee.org/document/8726358/
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Huiqin Jiang, Zehui Shao, Sakineh Nazari-Moghaddam, Enqiang Zhu, Seyed Mahmoud Sheikholeslami, Pu Wu
Publikováno v:
IEEE Access, Vol 6, Pp 74737-74746 (2018)
A Roman dominating function (RDF) on a graph $G$ is a function $f: V(G) \rightarrow \{0, 1, 2\}$ for which every vertex assigned 0 is adjacent to a vertex assigned 2. The weight of an RDF is the value $\omega (f) = \sum _{u \in V(G)}f(u)$ . The minim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84fcc63b658eeb93b627dffe01919c47
https://ieeexplore.ieee.org/document/8543236/
https://ieeexplore.ieee.org/document/8543236/