PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r)
Graph labelling is a function that maps graph elements to positive integers. A covering of graph is family subgraph from , for with integer k. Graph admits covering if for every subgraph is isomorphic to a graph . A connected graph is an - antimagic if there are positive integers and bijec...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Udayana
2017-05-01
|
| Series: | E-Jurnal Matematika |
| Online Access: | https://ojs.unud.ac.id/index.php/mtk/article/view/30826 |