Search
Now showing items 1-8 of 8
On Total r-Dynamic Coloring of Several Classes of Graphs and Their Related Operations
(roceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
All graphs in this paper are simple, connected and undirected. Let r, k be natural numbers. By a proper
k-coloring of a graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices receive ...
On The Metric Dimension with Non-isolated Resolving Number of Some Exponential Graph
(Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
Let w, w ∈ G = (V, E). A distance in a simple, undirected and connected graph G, denoted by d(v, w), is the
length of the shortest path between v and w in G. For an ordered set W = {w1, w2, w3, . . . , wk} of vertices and ...
On the Rainbow Vertex Connection Number of Edge Comb of Some Graph
(Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
By an edge comb, we mean a graph formed by combining two graphs G and H, where each edge of graph G is
replaced by the which one edge of graph H, denote by G D H. A vertex colored graph G D H = (V (G D H), E(G D H)) ...
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 ...
On the Metric-Location-Domination Number of Some Exponential Graphs
(The International Journal of Health, Education and Social (IJHES), 2019-11-30)
On the Metric-Location-Domination Number of Some Exponential Graphs
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 ...