Zobrazeno 1 - 10
of 131
pro vyhledávání: '"Dafik, Dafik"'
Publikováno v:
F1000Research, Vol 12 (2024)
textbf{Background}: One of the topics of distance in graphs is the resolving set problem. Suppose the set $W=\{s_1,s_2,…,s_k\}\subset V(G)$, the vertex representations of $\in V(G)$ is $r_m(x|W)=\{d(x,s_1),d(x,s_2),…,d(x,s_k)\}$, where $d(x,s_i)$
Externí odkaz:
https://doaj.org/article/88a6fc448ac14d3b9c67599edaac8871
Publikováno v:
Alifmatika, Vol 5, Iss 2, Pp 188-206 (2023)
In the era of the Industrial Revolution 4.0, learning mathematics puts more demands on students’ computational thinking skills. This research responds to this challenge by developing learning media assisted by iSpring Suite 9 and GeoGebra Software,
Externí odkaz:
https://doaj.org/article/f0044f1725854f7d87c2002e35b5daa3
Autor:
Robiatul Adawiyah, Arika Indah Kristiana, Dafik Dafik, Muhammad Lutfi Asy’ari, I Made Tirta, Zainur Rasyid Ridlo, Elsa Yuli Kurniawati
Publikováno v:
Tadris: Jurnal Keguruan dan Ilmu Tarbiyah, Vol 8, Iss 1, Pp 77-93 (2023)
Combinatorial generalization thinking, a component of higher-order thinking skills, encompasses perception (pattern identification), expressions (pattern illustration), symbolic expressions (pattern formulation), and manipulation (combinatorial resul
Externí odkaz:
https://doaj.org/article/21092d3459a84cb8b32fe0a665b80045
Publikováno v:
Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 7, Iss 1, Pp 64-72 (2021)
All graph in this paper are simple, finite, and connected. Let be a labeling of a graph . The function is called antimagic rainbow edge labeling if for any two vertices and , all internal vertices in path have different weight, where the weight of ve
Externí odkaz:
https://doaj.org/article/b46d3ca7833b4d9799ebe3dac5a462f2
Publikováno v:
SAR Journal - Science and Research. 4(4):196-204
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=1006814
Publikováno v:
Al-Jabar, Vol 12, Iss 1, Pp 25-34 (2021)
This research aimed to describe the development process and results of the Construct 2 Android-based education math game on number pattern subjects to increase student's ICT literacy. This research employed the Research and Development method with a
Externí odkaz:
https://doaj.org/article/f8e4b9db519942a7811c3b03647aff25
Publikováno v:
Alifmatika, Vol 3, Iss 1, Pp 55-69 (2021)
Developing critical and collaborative thinking skills among learners was of significant importance in the 21st-century era. In this study, the researcher applied teaching and learning based on Research-Based Learning (RBL) to know the level of studen
Externí odkaz:
https://doaj.org/article/1c56ec3a4b924b0590b89af344ede3f7
Publikováno v:
Symmetry, Vol 15, Iss 1, p 12 (2022)
Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If all edges have pairwise distinct weights, the function f is calle
Externí odkaz:
https://doaj.org/article/52191d23585040a69ddc2a04467798c5
Publikováno v:
Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 6, Iss 1, Pp 10-17 (2019)
The local adjacency metric dimension is one of graph topic. Suppose there are three neighboring vertex , , in path . Path is called local if where each has representation: a is not equals and may equals to . Let’s say, . For an order set of vertice
Externí odkaz:
https://doaj.org/article/b774f965fc2948bc82af27145c4cdb4c
Publikováno v:
CAUCHY: Jurnal Matematika Murni dan Aplikasi. 7:548-558
Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and . Rainbow antimagic coloring is a graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d4dd3a6f62c8d81ad509891c5c3c67f
https://doi.org/10.18860/ca.v7i4.17471
https://doi.org/10.18860/ca.v7i4.17471