Výsledky vyhledávání - "D A R Wardani"

On resolving perfect dominating number of comb product of special graphs

Autor: M. O. Aziza, D. A. R. Wardani, Dafik, A. I. Kristiana, Ridho Alfarisi

Publikováno v: Journal of Physics: Conference Series. 1832:012019

A set of vertices D ⊆ V(G) is the dominating set of graph G if every vertex on graph G is dominated by dominators. The dominating set of D on graph G is a perfect if every point of a graph G is dominated by exactly one vertex on D. For each vertex

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::26dc139f0cb9567e98713d67daef3b43
https://doi.org/10.1088/1742-6596/1832/1/012019

Zobrazit plný text záznamu

The distance 2-resolving domination number of graphs

Autor: Dafik, Mohammad Imam Utoyo, D. A. R. Wardani, K Dliou

Publikováno v: Journal of Physics: Conference Series. 1836:012017

The distance 2-resolving dominating set is the combination of two concepts, the resolving set and the distance 2-dominating set. The distance 2-resolving dominating set is a set that is both a distance 2-dominating set and a resolving set. The distan

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::47e4556db5e4bd25ec0cb6f9c4d621d8
https://doi.org/10.1088/1742-6596/1836/1/012017

Zobrazit plný text záznamu

The development of mathematical problem based on Higher Order Thinking Skill (HOTS) on comparative material by implementing PBL and its effect on the teacher’s creative thinking skill

Autor: U Royhana, B J Septory, Asri Widiatsih, D A R Wardani, F Djamali

Publikováno v: Journal of Physics: Conference Series. 1538:012110

Assessing both learning process and achievement is a pedagogical competency in which it refers to an ability that must be possessed by the teacher. The learning done by teacher is intended to maximize the students’ higher order thinking skills, tha

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e79e514dd32d1cc797a50aaab442e4d9
https://doi.org/10.1088/1742-6596/1538/1/012110

Zobrazit plný text záznamu

On resolving domination number of friendship graph and its operation

Autor: D. A. R. Wardani, Dafik, E. R. Albirri, Syukria Kurniawati, Slamin

Publikováno v: Journal of Physics: Conference Series. 1465:012019

Let G = (V, E) be a simple, finite, and connected graph of order n. A dominating set D ⊆ V(G) such every vertex not in D is adjacent to at least one member of D. A dominating set of smallest size is called a minimum dominating set and it is known a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::04590ec08006d1208ba9109c8cf4ae42
https://doi.org/10.1088/1742-6596/1465/1/012019

Zobrazit plný text záznamu

The locating dominating set (LDS) of generalized of corona product of path graph and any graphs

Autor: Dafik, I. H. Agustin, D. A. R. Wardani

Publikováno v: Journal of Physics: Conference Series. 1465:012028

Graph G is usually written by G = (V, E) is graph G where V(G) is vertex set on graph G and E(G) is edge set on graph G. Graph G used in this study is only on simple and undirected graphs. Dominating set (DS) is graph G which have a vertex set D, whe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cd60871d9834b53d7a8488019fde52ff
https://doi.org/10.1088/1742-6596/1465/1/012028

Zobrazit plný text záznamu

On resolving domination number of special family of graphs

Autor: Ridho Alfarisi, Y. Wangguway, Slamin, D. A. R. Wardani, Dafik

Publikováno v: Journal of Physics: Conference Series. 1465:012015

Let G be a simple, finite, and connected graph. A dominating set D is a set of vertices such that each vertex of G is either in D or has at least one neighbor in D. The minimum cardinality of such a set is called the domination number of G, denoted b

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b7c8600ad241e4a37c8ceb24606d0aac
https://doi.org/10.1088/1742-6596/1465/1/012015

Zobrazit plný text záznamu

On the LIDS of corona product of graphs

Autor: Marsidi, C. D. Putri, Ika Hesti Agustin, Dafik, D. A. R. Wardani

Publikováno v: AIP Conference Proceedings.

Let G = (V, E) be a simple, undirected, and nontrivial graph. An independent set is a set of vertices in a graph in which no two of vertices are adjacent. A dominating set of a graph G is a set D of vertices of G such that every vertex not in S is ad

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ca021a16e05ee08f8bf1af00b1c4c8cc
https://doi.org/10.1063/1.5054491

Zobrazit plný text záznamu

The r-dynamic chromatic number of corona of order two of any graphs with complete graph

Autor: E. Y. Kurniawati, B. J. Septory, I. H. Agustin, Dafik, A. I. Kristiana, D. A. R. Wardani

Publikováno v: Journal of Physics: Conference Series. 1306:012046

The corona of two graphs G and H is a graph G ⊙ H formed from one copy of G and |V (G)| copies of H where the ith vertex of G is adjacent to every vertex in the ith copy of H. For any integer l ≤ 2, we define the graph G ⊙ l H recursively from

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ef8c8e85a6240dec2f15ed1006dfb1a9
https://doi.org/10.1088/1742-6596/1306/1/012046

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání