OPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH
A monitored system can be modeled as a graph G. Such that the intruder detection is location-specific and efficient, placing monitoring devices in the system can be considered as an open neighborhood locating-dominating problem. An open neighborhood set S in graph G is a minimum vertex set with the...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/24685 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | A monitored system can be modeled as a graph G. Such that the intruder detection is location-specific and efficient, placing monitoring devices in the system can be considered as an open neighborhood locating-dominating problem. An open neighborhood set S in graph G is a minimum vertex set with the property that for each vertex v in G, its open neighborhood has a unique non-empty intersection with S. In this book, we will continue the discussion of OLD-set problem, specifically in Mycielski graphs. |
|---|