GEODETIC DOMINATION NUMBER OF MYCIELSKI GRAPH
For any graph G the set of vertices is denoted by V (G) and the edge set by E(G). A vertex in graph G dominates itself and neighbors. A set of vertices D in graph G is a dominating set if each vertex of G is dominated by some vertex of D. A x-y path of length d(x, y) is called x-y geodesic. The clo...
Saved in:
主要作者: | |
---|---|
格式: | Final Project |
語言: | Indonesia |
在線閱讀: | https://digilib.itb.ac.id/gdl/view/23343 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Institut Teknologi Bandung |
語言: | Indonesia |
成為第一個發表評論!