Search
Now showing items 61-69 of 69
An Inclusive Local Irregularity Coloring of Graphs
(Advances in Mathematics: Scientific Journal, 2020)
All graph in this paper are connected and simple. Let G = (V, E) be a simple graph, where V (G) is vertex set and E(G) is edge set. The local irregularity vertex coloring of G is l : V (G) → {1, 2, · · · , k} and w : V (G) ...
On the r-Dynamic Chromatic Numberof Corona Product of Star Graph
(Thai Journal of Mathematics, 2022-10-01)
A proper k coloring of graph G such that the neighbors of any vertex v ∈ V (G) where at least min{r, d(v)} different colors is defined an r-dynamic coloring. The minimum k such that graph G has an r-dynamic k coloring is ...
Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph
(Jurnal Ilmu Dasar, 2014-07-01)
Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic
total if there exist a bijection f : V (G) ∪ E(G) → {1, 2,...,p + q} such that the edge-weights, w(uv) =
f(u)+f(v)+f(uv); u, v ∈ V ...
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 Sisi Ketakteraturan Lokal Refleksif pada Keluarga Graf Planar
(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 ...
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 ...
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 ...