Total Edge Irregularity Strength of the Disjoint Union of Helm Graphs
Journal of Mathematical and Fundamental Sciences · 2013
DOI: 10.5614/j.math.fund.sci.2013.45.2.6 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Mathematical and Fundamental Sciences, 2013. Verfasst von Muhammad Kamran Siddiqui und 2 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref).
Abstract (Originalsprache)
The total edge irregular k-labeling of a graph G=(V,E) is the labeling of vertices and edges of G in such a way that for any different edges their weights are distinct. The total edge irregularity strength, tes (G) , is defined as the minimum k for which G has a total edge irregular k -labeling. In this paper, we consider the total edge irregularity strength of the disjoint union of m special types of helm graphs.
Zitieren
APA
Siddiqui, M. K., Nurdin, N., & Baskoro, E. T. (2013). Total Edge Irregularity Strength of the Disjoint Union of Helm Graphs. Journal of Mathematical and Fundamental Sciences. https://doi.org/10.5614/j.math.fund.sci.2013.45.2.6
Vancouver
Siddiqui MK, Nurdin N, Baskoro ET. Total Edge Irregularity Strength of the Disjoint Union of Helm Graphs. Journal of Mathematical and Fundamental Sciences. 2013. doi:10.5614/j.math.fund.sci.2013.45.2.6
BibTeX
@article{Siddiqui2013,
author = {Siddiqui, Muhammad Kamran and Nurdin, Nurdin and Baskoro, Edy Tri},
title = {Total Edge Irregularity Strength of the Disjoint Union of Helm Graphs},
journal = {Journal of Mathematical and Fundamental Sciences},
year = {2013},
doi = {10.5614/j.math.fund.sci.2013.45.2.6}
}
EUVIMED