Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS

Dimensi Metrik Ketetanggaan Lokal pada Graf Hasil Operasi Korona G odot P_3 dan G odot S_4 Alfin Nabila Taufik; Dafik Dafik; Rafiantika Megahnia Prihandini; Ridho Alfarisi
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (350.338 KB) | DOI: 10.25037/cgantjma.v1i2.43

Abstract

There are variant of the metric dimensions in graph theory, one of them is a local adjacency metric dimension. Let $W\subset V(G)$ with $W=\{w_1,w_2,\dots,w_k\}$, the representation of the vertex $V\in V(G)$, $r_A(v|W)=(d_A(v,w_1),d_A(v,w_2),\dots,d_A(v,w_k))$ with $ d_ {A} (v, w) $= $ 0 $ if $ v = w $, $ d_ {A} (v, w) $=  $ 1 $ if $ v$ adjacent to $w $, and $ d_ {A} (v, w) $ =$ 2 $ if $ v $ does not adjacent to $ w $.  If every two adjacent vertices $ v_1 $, $ v_2 \in V (G) $,  $ r_ {A} (v_1 | W) \neq r_ {A} (v_2 | W) $, then $W$ is the minimum cardinality of the local adjacency metric dimension. The minimum cardinality of $W$ is called the local adjacency metric dimension number, denoted by $ \dim_{(A, l)} (G) $.  In this paper, we have found the  local adjacency metric dimension of corona product of special graphs, namely the $ L_n \odot {P_3} $ graph, $ S_n \odot {P_3} $ graph, $ C_n \odot {P_3} $ graph, $ P_n \odot {S_4} $ graph, and the graph $ L_n \odot {S_4} $. 
Pewarnaan Ketakteraturan Lokal Inklusif pada Keluarga Graf Pohon Tree Umi Azizah Anwar; Arika Indah Kristiana; Arif Fatahillah; Dafik Dafik; Ridho Alfarisi
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 1 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (289.093 KB) | DOI: 10.25037/cgantjma.v2i1.49

Abstract

All graph in this paper is a simple and connected graph. We define $l: V(G) \to \{ 1, 2, 3,...k\} $ is called vertex irregular k-labeling and $w: (G) \to N$ the weight function with $[\sum_{u \epsilon N} l(u) + l(v) ]$. A local irregularity inclusive coloring if every $u, v \epsilon E(G), w(u) \ne w(v) $ and $max (l) = min \{ max (l_i), l_i label function\}$. The chromatic number of local irregularity inclusive coloring of $G$ denoted by $\chi_{lis}^{i}$, is the minimum cardinality of local irregularity inclusive coloring. We study about the local irregularity inclusive coloring of some family tree graph and we have found the exact value of their chromatic number.