TOTAL EDGE IRREGULARITY STRENGTH DARI GRAF K_n-{e}
##plugins.pubIds.doi.readerDisplayName##
https://doi.org/10.24843/MTK.2018.v07.i01.p182
Abstrak
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
##plugins.generic.usageStats.downloads##
##plugins.generic.usageStats.noStats##
Diterbitkan
2018-02-03
##submission.howToCite##
MUARDI, .; AINI, QURRATUL; IRWANSYAH, ,.
TOTAL EDGE IRREGULARITY STRENGTH DARI GRAF K_n-{e}.
E-Jurnal Matematika, [S.l.], v. 7, n. 1, p. 36-40, feb. 2018.
ISSN 2303-1751. Tersedia pada: <https://ojs.unud.ac.id/index.php/mtk/article/view/37604>. Tanggal Akses: 18 dec. 2025
doi: https://doi.org/10.24843/MTK.2018.v07.i01.p182.
Terbitan
Bagian
Articles
##submission.license.cc.by4.footer##

This work is licensed under a Creative Commons Attribution 4.0 International License.
