Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Jurnal Matematika UNAND
Mariza Wenni
Unknown Affiliation
Computer Science & IT Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
BILANGAN KROMATIK LOKASI DARI GRAF P m P n ; K m P n ; DAN K , m K n Mariza Wenni
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.14-22.2013

Abstract

Let G and H be two connected graphs. Let c be a vertex k-coloring of aconnected graph G and let = fCg be a partition of V (G) into the resultingcolor classes. For each v 2 V (G), the color code of v is dened to be k-vector: c1; C2; :::; Ck(v) =(d(v; C1); d(v; C2); :::; d(v; Ck)), where d(v; Ci) = minfd(v; x) j x 2 Cg, 1 i k. Ifdistinct vertices have distinct color codes with respect to , then c is called a locatingcoloring of G. The locating chromatic number of G is the smallest natural number ksuch that there are locating coloring with k colors in G. The Cartesian product of graphG and H is a graph with vertex set V (G) V (H), where two vertices (a; b) and (a)are adjacent whenever a = a0and bb02 E(H), or aa0i2 E(G) and b = b, denotedby GH. In this paper, we will study about the locating chromatic numbers of thecartesian product of two paths, the cartesian product of paths and complete graphs, andthe cartesian product of two complete graphs.
Co-Authors