Search
Now showing items 1-9 of 9
The Level Of Critical Thinking Skill On Solving Two-dimensional Arithmetics Problems Through Research-based Learning
(Jurnal Pendidikan dan Pembelajaran Matematika, 2021-06-01)
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 ...
Antibacterial Effects of Pheretima Javanica Extract and Bioactive Chemical Analysis Using Gas Chromatography Mass Spectrum
(Journal of Physics: Conference Series, 2021-01-27)
Pheretima sp is an earthworm from the Oligochaeta group found mostly in Java. The
characteristics has segments reaching 95-150 segments. Clitellum is located in segment 14-16.
The body fluids contain protein, amino acids ...
Pewarnaan Sisi r-Dinamis pada Graf Khusus dan Graf Operasi Sakel
(CGANT Journal of Mathematics and Applications, 2021-06-01)
Let G = (V (G), E(G)) be a nontrivial connected graph. The edge coloring is defined as
c : E(G) → {1, 2, ..., k}, k ∈ N, with the condition that no adjacent edges have the same
color. k-color r-dynamic is an edge coloring ...
Analysis of the Influence of Local Politics on Implementation SDGs 4 Policy for Quality Education
(SAR JOURNAL, 2021-12-01)
SDGs-4, the quality education is one of the
factors in achieving the goals of the SDGs. The
problem is that the SDGs look ambitious in integrating
local level policies that are responsive to political
interests. The ...
On r-dynamic vertex coloring of some flower graph families
(World Scientific Publishing Company, 2021-03-03)
e a simple, connected undirected graph with m vertices and n edges. Let ver tex coloring c of a graph G be a mapping c : V (G) → S, where |S| = k and it is k-colorable. Vertex coloring is proper if none of the any two ...
On the local irregularity vertex coloring of volcano, broom, parachute, double broom and complete multipartite graphs
(World Scientific Publishing Company, 2021-09-05)
Let G = (V,E) be a simple, finite, undirected, and connected graph with vertex set V (G) and edge set E(G). A bijection l : V (G) → {1, 2,...,k} is label function l if opt(l) = min{max(li) : li vertex irregular labeling} ...
Analisa Pewarnaan Total r-Dinamis pada Graf Lintasan dan Graf Hasil Operasi
(CGANT Journal of Mathematics and Applications, 2021-06-22)
Graph coloring began to be developed into coloring dynamic. One of the developments of
dynamic coloring is r-dynamic total coloring. Suppose G = (V (G), E(G)) is a non-trivial
connected graph. Total coloring is defined ...
Analisa Antimagic Total Covering Super pada Eksponensial Graf Khusus dan Aplikasinya dalam Mengembangkan Chipertext
(CGANT Journal of Mathematics and Applications, 2021-06-22)
Let Hi be a finite collection of simple, nontrivial and undirected graphs and let each Hi
have a fixed vertex vj called a terminal. The amalgamation Hi as vj as a terminal is formed
by taking all the Hi’s and identifying ...
Metric Dimension dan Non-Isolated Resolving Number pada Beberapa Graf
(CGANT JOURNAL OF MATHEMATICS AND APPLICATION, 2021-06-01)
Let G = (V, E) be a set of ordered set W = {W1, W2, W3, ..., Wk} from the set of vertices
in connected graph G. The metric dimension is the minimum cardinality of the resolving
set on G. The representation of v on W is ...