ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2
A locating-domination set is defined as a set of vertices S ? V (G) such that for every two distinct vertices u, v ? V (G) \ S, ? ?= N(u) ? S ?= N(v) ? S ?= ?. The minimum cardinality of locating-domination sets of G is called the locatingdomination number of G, denoted by ?(G). The cartesian pro...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/68830 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |