Search
Now showing items 1-2 of 2
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 ...
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 ...