PELABELAN TOTAL VERTEKS IRREGULAR PADA BEBERAPA GRAF HASIL KALI KARTESIUS
A total vertex irregular labeling of a graph G(V (G),E(G)), with v vertices and e edges, is an assignment: f : V (G) ? E(G) ? {1, 2, . . . , r} so that w(v) = f(v) +Pf(uv) are distinct for all vertices v ? V (G). The value of w(v) is called a weight of vertex v. Total vertex irregularity strengt...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/11293 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|