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: | LARASARTIKA (10113065), WEDYATA |
---|---|
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 |
Similar Items
-
GEODETIC DOMINATION NUMBER OF MYCIELSKI GRAPH
by: Sukma Alam, Muhammad -
ON LOCATING CHROMATIC NUMBER OF MYCIELSKI
by: Angelia Susanti, Debbie -
THE LOCAL METRIC DIMENSION OF MYCIELSKI'S GRAPH
by: FAHRI TADJUDDIN (90115012), NUR -
LOCATING-DOMINATING SET OF HONEYCOMB NETWORK GRAPH
by: Hardianto, Candra -
ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2
by: Rizqi Az-Zukruf A.S., Ikhsan