Iswadi, Hazrul (2011) Bilangan Dominasi Lokasi Metrik dari Graf Hasil Operasi Korona. Prosiding Seminar Nasional Matematika Unand 2011. pp. 2229. ISSN 9786021924907

PDF
hazrul_Bilangan Dominasi Lokasi Metrik_2011.pdf  Published Version Download (185Kb)  Preview 
Abstract
For an ordered set $W = {w_1, w_2 , \cdots, w_k}$ of vertices and a vertex $v$ in a connected graph $G$, the representation of $v$ with respect to $W$ is the ordered $k$tuple $r(vW) = (d(v,w_1), d(v,w_2 ), \cdots, d(v,w_k))$, where $d(x,y)$ represents the distance between the vertices $x$ and $y$. The set $W$ is called a locating set for $G$ if every vertex of $G$ has a distinct representation. A locating set containing a minimum number of vertices is called a basis for $G$. The metric dimension of $G$, denoted by dim($G$), is the number of vertices in a basis of $G$. A set $W$ of vertices of a connected graph $G$ is a dominating set of $G$ if every vertex in $V(G)  W$ is adjacent to a vertex of $W$. A dominating set $W$ in a connected graph $G$ is a metriclocatingdominating set, or an MLDset, if $W$ is both a dominating set and a locating set in $G$. The metric location domination number $\gamma_M(G)$ of $G$ is the minimum cardinality of an MLDset in $G$. A graph $G$ corona $H$, $G \odot H$, is defined as a graph which formed by taking $V(G)$ copies of graphs $H_1, H_2, \cdots, H_n$ of $H$ and connecting $i$th vertex of $G$ to every vertices of $H_i$. We determine the metriclocationdomination number of corona product graphs in terms of the metric dimension of $G$ or $H$.
Item Type:  Article 

Uncontrolled Keywords:  Metric dimension, metriclocatingdominating set, metriclocationdomination number, corona product graph. 
Subjects:  Q Science > QA Mathematics 
Divisions:  Academic Department > Department of Mathematics and Natural Science 
Depositing User:  Hazrul Iswadi 6179 
Date Deposited:  29 Mar 2012 05:38 
Last Modified:  29 Mar 2012 05:38 
URI:  http://repository.ubaya.ac.id/id/eprint/273 
Actions (login required)
View Item 