DETERMINATION AND CHARACTERIZATION OF METRIK-LOCATION-DOMINATION NUMBER FOR SEVERAL CLASSES OF GRAPHS
Let G = (V;E) be a simple, finite and connected graph. A set D V is said to be a dominating set of G if every vertex v 2 V ???? D is adjacent to a vertex in D. The minimum cardinality of the dominating set of G is called a domination number of G. The representation of a vertex v 2 V (G) with res...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertations |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/79625 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |