Open AccessTOTAL EDGE IRREGULARITY STRENGTH DARI GRAF K_n-{e}
Author(s) -
- MUARDI,
QURRATUL AINI,
Irwansyah Irwansyah
Publication year - 2019
Publication title -
e-jurnal matematika
Language(s) - English
Resource type - Journals
ISSN - 2303-1751
DOI - 10.24843/mtk.2019.v08.i02.p237
Subject(s) - labelling , enhanced data rates for gsm evolution , graph , combinatorics , mathematics , computer science , artificial intelligence , chemistry , biochemistry
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, the third case could not happen. As a result, the total edge irregularity strength of equals to the total edge irregularity strength of Kn