Search
Now showing items 1-8 of 8
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 ...
On the Local Multiset Dimension of Graph With Homogenous Pendant Edges
(Journal of Physics: Conference Series, 2019-12-01)
Let G be a connected graph with E as edge set and V as vertex set . rm(v|W) =
{d(v, s1), d(v, s2), . . . , d(v, sk)} is the multiset representation of a vertex v of G with respect to
W where d(v, si) is a distance between ...
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 ...
The Local (Adjacency) Metric Dimension of Split Related Complete Graph
(IOP Conf. Series: Journal of Physics: Conf. Series, 2019-04-01)
Let G be a simple graph. A set of vertices, called V (G) and a set of edges, called
E(G) are two sets which form graph G. W is a local adjacency resolving set of G if for every
two distinct vertices x, y and x adjacent ...
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 ...
Some Families of Tree Are Elegant
(Advances in Mathematics: Scientific Journal 9, 2020-12-04)
An elegant labeling on the graph G with n vertex and m edge is a
one-to-one mapping (injection function) of the vertex set V (G) to the set of non
negative integers {0, 1, 2, 3, . . . , m} such that each edge gets the ...
Research Based Learning and STEM Learning Activities: The Use of R-Dynamic Coloring to Improve the Students Meta-literacy in Solving a Tessellation Decoration Problem
(European Journal of Education and Pedagogy, 2022-08-02)
The meta-literacy ability is very important in today's life, especially living in the disruptive technology era. Meta-literacy is an ability that goes beyond metacognition and technological literacy. However, the students’ ...
Pewarnaan Titik Ketakteraturan Lokal Refleksif pada Keluarga Graf Tangga
(CGANT Journal of Mathematics and Applications, 2022)
Let a simple and connected graph G = (V, E) with the vertex set V (G) and the edge set E(G). If there is a mapping f: V (G) → 0, 2, . . . , 2kv and f: E(G) → 1, 2, . . . , ke as a function of vertex and edge irregularities ...