Zobrazeno 1 - 9
of 9
pro vyhledávání: '"B J Septory"'
Publikováno v:
Journal of Physics: Conference Series. 2157:012017
Nowadays, cryptosystems can be applied in several areas in life. One of them is in transaction data. In transaction data, a very strong cryptosystem is needed so that the transaction data is safe. Cryptosystems are better with a strong keystream. In
Publikováno v:
Journal of Physics: Conference Series. 1836:012054
Critical thinking in learning is very necessary because critical thinking is an asset for students to be able to develop knowledge widely. The cooperative learning model of the student team achievement division type is one of the learning models used
Publikováno v:
Journal of Physics: Conference Series. 1836:012016
Let G(V, E) be a connected, undirected and simple graph with vertex set V(G) and edge set E(G). A labeling of a graph G is a bijection f from V(G) to the set {1, 2,…, | V(G)|}. The bijection f is called rainbow antimagic vertex labeling if for any
Publikováno v:
Journal of Physics: Conference Series. 1836:012049
4C’s skills (creative, critics, collaborative, communicative) are the skills that are required in the 21st-century era. Accordingly, creative thinking ability is one of the demands required. It can be develop anywhere; one of them is in the impleme
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
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
Publikováno v:
IOP Conference Series: Earth and Environmental Science. 243:012113
In this study we assume every graphs be a simple, finite, nontrivial, connected and undirected graphs with vertex set V(H), edge set E(H) and no isolated vertex. An r-dynamic coloring of a graph H is a proper k-coloring of graph H such that the neigh
Publikováno v:
Journal of Physics: Conference Series. 1211:012084
Publikováno v:
Journal of Physics: Conference Series; 2019, Vol. 1306 Issue 1, p1-1, 1p