TOTAL EDGE IRREGULARITY STRENGTH DARI GRAF K_n-{e}
In this paper we determine the total edge irregularity strength of , that is a complete graph in which one of its edge has been removed. To do so, we make three cases. In two cases, the labelling of equals to the labelling of the complete graph such that no re-labelling is necessary. Meanwhile, t...
Main Authors: | . MUARDI, QURRATUL AINI, , IRWANSYAH |
---|---|
Format: | Article |
Language: | English |
Published: |
Universitas Udayana
2018-02-01
|
Series: | E-Jurnal Matematika |
Online Access: | https://ojs.unud.ac.id/index.php/mtk/article/view/37604 |
Similar Items
-
TOTAL EDGE IRREGULARITY STRENGTH DARI GRAF K_n-{e}
by: MUARDI - ,, et al.
Published: (2019-05-01) -
Bilangan Terhubung Pelangi Graf Bunga (W_m,K_n ) dan Graf Lemon (Le_n)
by: Irvania Sukma Kumala
Published: (2019-03-01) -
PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF K_n
by: Dewi Suhika, et al.
Published: (2018-06-01) -
The Linear k-arboricity of $K_n$ and $K_{n,n}$
by: Huang,Wen Ting, et al.
Published: (1998) -
On total edge irregularity strength of polar grid graph
by: F. Salama
Published: (2019-12-01)