LOCATING-DOMINATING SET OF HONEYCOMB NETWORK GRAPH
Architecture of microprocessor networks can be modelled with graphs. The Security of a microprocessor network architecture can be analyzed by using locating-dominating sets. A locating-dominating set is a set ÿ ? ý(ÿ) where for every vertices ÿ, ? ? ý(ÿ) ? ÿ, the neighborhood of vertex ÿ that are...
Saved in:
Main Author: | Hardianto, Candra |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/71805 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
OPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH
by: LARASARTIKA (10113065), WEDYATA -
ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2
by: Rizqi Az-Zukruf A.S., Ikhsan -
CORDIAL INDEX OF HONEYCOMB NETWORK GRAPH
by: SHOFY ADIANTO (10111020), ABDURRAHMAN -
CORDIAL INDEX OF HONEYCOMB NETWORK GRAPH
by: Shofy Adianto, Abdurrahman -
MAGIC DOMINATING SETS OF GRAPHS
by: Ali Hasan, M.