GEODETIC DOMINATION NUMBER OF MYCIELSKI GRAPH
For any graph G the set of vertices is denoted by V (G) and the edge set by E(G). A vertex in graph G dominates itself and neighbors. A set of vertices D in graph G is a dominating set if each vertex of G is dominated by some vertex of D. A x-y path of length d(x, y) is called x-y geodesic. The clo...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/23343 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |