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