Search
Now showing items 1-10 of 14
The Effect of Jumping Task Based on Creative Problem Solving on Students’ Problem Solving Ability
(International Journal of Instruction, January 2020 ● Vol.13, No.1, 2020-01-01)
This study aims to study the effectiveness of jumping task application based on
creative problem solving in improving students’ problem-solving abilities. The
study was applied triangulation method, namely qualitative ...
Resolving Domination Numbers of Family of Tree Graph
(International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 27-30, 2020-01-09)
All graph in this paper are members of family of graph tree. Let G is a connected graph, for an ordered set
W={w1,w2,...,wk} of vertices and a vertex which is not element of W, then W is dominating set of graph G when the ...
r-Dynamic Coloring of the Corona Product of Graphs
(Discrete Mathematics, Algorithms and Applications Vol. 12, No. 2 (2020) 2050019, 2020-01-21)
Let G = (V, E) be a graph. A proper k-coloring of graph G is r-dynamic coloring if
for every v, the neighbors of vertex v receive at least min
{
r, d(v)
}
different colors. The
minimum k such that graph G has r-dynamic ...
Modul Aplikasi Graf dalam Bioteknologi
(Fakultas Keguruan dan Ilmu Pendidikan - UNEJ, 2020-01-09)
Modul ini disusun untuk membantu mahasiswa Program Studi
Pendidkan Matematika Fakultas Keguruan dan Ilmu Pendidikan, Universitas
Jember. Teori graf dikenalkan oleh Leonhard Euler, seorang matematikawan
Swiss diperkirakan ...
Local Irregular Vertex Coloring of Some Families Graph
(Journal of Discrete Mathematical Sciences and Cryptography, (DOI : 10.1080/09720529.2020.1754541), 2020-06-09)
All graph in this paper is connected and simple graph. Let d(u, v) be a distance between
any vertex u and v in graph G = (V, E ). A function : ( )
l V G
{1, 2,
, }
k
→
is called vertex irregular
k-labelling ...
On the Local Irregularity Vertex Coloring of Related Grid Graph
(International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 2, February – 2020, Pages: 1-4, 2020-02-01)
All graph in this paper is connected and simple graph. Let graph d(u,v) be a distance between any vertex u and v in
graph ( ). A functio ( ) * +n is called vertex irregular k-labelling and ( ) where ...
On The Packing k-Coloring of Unicyclic Graph Family
(International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 1-9, 2020-01-09)
All graph in this paper is connected graph. Let
du,v
be a distance between any vertex
u
and
v
in graph
GV,E.
A function
c :VG 1, 2, , k
is called a packing
k coloring if every two vertex of color
i
are ...
The Effectiveness of Madurese Culture Wisdom on Science Learning Sound Material in Primary School Students’ Critical Thinking Skills
(IOP Conference Series: Earth and Environmental Science, 2020-09-12)
Lack of insertion or understanding of local culture and traditions in classroom
learning will cause students to appreciate the existing culture and grow in their environment.
This research is a development research. The ...
Elegant Labeling Of Some Graphs
(Journal of Physics: Conference Series, 2020-12-01)
In this paper, we introduce a new notion of graph theory study, namely a local
edge metric dimension. It is a natural extension of metric dimension concept. dG(e, v) =
min{d(x, v), d(y, v)} is the distance between the ...
Elegant Labeling of Some Graphs
(Journal of Physics: Conference Series, 2020-06-19)
An elegant labeling on graph G with vertices and edges is an injective
(one-to-one) mapping from the set of vertices V (G) to the set of non-negative integers
f0; 1; 2; 3; :::; g in such a way that the set of values ...