Total Edge Irregularity Strength of q Tuple Book Graphs
Yeni Susanti and
Diah Junia Eksi Palupi
Journal of Mathematics Research, 2021, vol. 13, issue 1, 16
Let G(V, E) be a simple, undirected, and finite graph with a vertex set V and an edge set E. An edge irregular total k-labelling is a function f from the set V \cup E to the set of non-negative integer set (1, 2, ... , k) such that any two different edges in E have distinct weights. The weight of edge xy is defined as the sum of the label of vertex x, the label of vertex y and the label of edge xy. The minimum k for which the graph G can be labelled by an edge irregular total k-labelling is called the total edge irregularity strength of G, denoted by tes(G). We have constructed the formula of an edge irregular total k-labelling and determined the total edge irregularity strength of triple book graphs, quadruplet book graphs and quintuplet book graphs. In this paper, we construct an edge irregular total of k-labelling and show the exact value of the total edge irregularity strength of q tuple book graphs.
JEL-codes: R00 Z0 (search for similar items in EconPapers)
References: View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:ibn:jmrjnl:v:13:y:2021:i:1:p:16
Access Statistics for this article
More articles in Journal of Mathematics Research from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().