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:
主要作者: | Hardianto, Candra |
---|---|
格式: | Final Project |
語言: | Indonesia |
在線閱讀: | https://digilib.itb.ac.id/gdl/view/71805 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
OPEN NEIGHBORHOOD LOCATING-DOMINATING SET IN MYCIELSKI GRAPH
由: LARASARTIKA (10113065), WEDYATA -
ON LOCATING-DOMINATION SET OF CARTESIAN PRODUCT GRAPHS P2
由: Rizqi Az-Zukruf A.S., Ikhsan -
CORDIAL INDEX OF HONEYCOMB NETWORK GRAPH
由: Shofy Adianto, Abdurrahman -
CORDIAL INDEX OF HONEYCOMB NETWORK GRAPH
由: SHOFY ADIANTO (10111020), ABDURRAHMAN -
MAGIC DOMINATING SETS OF GRAPHS
由: Ali Hasan, M.