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 |
| id |
id-itb.:24685 |
|---|---|
| spelling |
id-itb.:246852017-09-27T11:43:15ZOPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH LARASARTIKA (10113065), WEDYATA Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/24685 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. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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. |
| format |
Final Project |
| author |
LARASARTIKA (10113065), WEDYATA |
| spellingShingle |
LARASARTIKA (10113065), WEDYATA OPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH |
| author_facet |
LARASARTIKA (10113065), WEDYATA |
| author_sort |
LARASARTIKA (10113065), WEDYATA |
| title |
OPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH |
| title_short |
OPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH |
| title_full |
OPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH |
| title_fullStr |
OPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH |
| title_full_unstemmed |
OPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH |
| title_sort |
open neighborhood locating-dominating set in mycielski graph |
| url |
https://digilib.itb.ac.id/gdl/view/24685 |
| _version_ |
1822921312299909120 |