Search
Now showing items 1-10 of 16
The Effectiveness of Research Based Learning in Improving Students’ Achievement in Solving Two-Dimensional Arithmetic Sequence Problems
(International Journal of Instruction, January 2019 ● Vol.12, No.1, 2019-01-01)
The present study aims to investigate the effectiveness of Research Based
Learning (RBL) in improving students’ learning achievement in solving two
dimensional arithmetic sequence problems. The study applied triangulation ...
The r-Dynamic Local Irregularity Vertex Coloring of Graph
(INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 07, JULY 2019, 2019-07-01)
We define the r-dynamic local irregularity vertex coloring. Suppose : V(G) {1,2, … , k} is called vertex irregular k-labeling and w : V(G)
N where 𝑤(𝑢) = ∑
(𝑣)
. is called r-dynamic local irregular vertex ...
Vertex Coloring Edge-Weighting of Coronation by Path Graphs
(IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012004, 2019-05-07)
In this paper, we study vertex coloring edge of corona graph. A k-edge weigting of
graph G is mapping w : (EG) ! f1; 2; ; kg. An edge-weighting w induces a vertex coloring
Fw : V (G) ! N de ned by fw(v) =
P
v2e
w(e). ...
Local Antimagic r-dynamic Coloring of Graphs
(IOP Conf. Series: Earth and Environmental Science 243 (2019) 012077, 2019-04-09)
Let G = (V; E) be a connected graph. A bijection function f : E(G) !
f1; 2; 3; ; E(G)jg is called a local antimagic labeling if for all uv 2 E(G)s, w(u)
6= w(v),
where w(u) = e2E(u)f(e). Such that, local antimagic ...
On The Rainbow Antimagic Connection Number of Some Wheel Related Graphs
(International Journal of Academic and Applied Research (IJAAR), Vol.3 Issue 12, December – 2019, Pages: 60-64, 2019-12-01)
All graphs in this paper is connected and simple. Let ( ) be a connected and simple graph with vertices set and
edge set . A bijection function * | ( )|+ is called an edge antimagic vertex ...
On The Packing k-Coloring of Edge Corona Product
(International Journal of Academic and Applied Research (IJAAR), Vol. 3 Issue 12, December – 2019, Pages: 55-59, 2019-12-01)
All graph in this paper is connected and simple graph. Let
du,v
be a distance between any vertex
u
and
v
in graph
G V,E
. A function
c :VG1, 2,, k
is called a packing k-coloring if every two vertices ...
On the Chromatic Number Local Irregularity of Related Wheel Graph
(IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012003, 2019-05-07)
A function f is called a local irregularity vertex coloring if (i) l : V (G) !
f1; 2; ; kg as vertex irregular k-labeling and w : V (G) ! N, for every uv 2 E(G); w(u)
6= w(v)
where w(u) = v2N(u)l(v) and (ii) ...
Resolving Domination Number of Graphs
(Discrete Mathematics, Algorithms and Applications, Vol. 11, No. 6 (2019) 1950071, 2019-11-05)
For a set W =
{
s1,s2,...,sk
of vertices of a graph G, the representation multiset of
a vertexv of G with respect to W is r(v
|
W ) =
{
d(v, s1),d(v, s2),...,d(v, sk)
}
, where
d(v, si) is a distance between of ...
Metric Chromatic Number of Unicyclic Graphs
(INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 06, JUNE 2019, 2019-06-09)
All graphs in this paper are nontrivial and connected graph. Let 𝑓 ∶ 𝑉 (𝐺) → *1,2, … , 𝑘+ be a vertex coloring of a graph 𝐺where two adjacent
vertices may be colored the same color. Consider the color classes Π = ...
The Effectiveness of Research-Based Learning With Computer Programming and Highly Interactive Cloud Classroom (Hic) Elaboration in Improving Higher Order Thinking Skills in Solving a Combination of Wave Functions
(IOP Conf. Series: Journal of Physics, 2019-05-07)
The aim of this research was to compare the HIC (Highly interactive
classroom) system with a traditional method of teaching superposition of wave functions
courses especially. In order to examine it’s learning effectiveness ...