M.R. Maulana, I. Rosyida, Mulyono
Given a graph G consisting of vertex set V and edget set E, repectively. Assume G is simple, connected, and the edges do not have direction. A function λ that maps V ∪ E into a set of κ-integers is named a totally irregular total k-labelling if no vertices have the same weight and also the edges of G get distinct weights. We call the minimum number k for which G has totally irregular total k-labelling as total irregularity strength of G, ts(G). In this article, we construct labels of vertices and edges of caterpillar graphs which have q internal vertices of degree 3 where q is 5,7, and 9. We obtain the exact values of ts in the following: n + 2 if the caterpillars have q=5 internal vertices, n + 3 for q=7, and n + 4 for q=9. © Published under licence by IOP Publishing Ltd.
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Semarang, Indonesia
Research at a Glance
Register to unlock
Topics & SDG Alignment
Register to unlock
Collaboration
Register to unlock
Author Profile (Selected)
Register to unlock
References Overview
Register to unlock
Journal & Source
Register to unlock
Metadata & Integrity
Register to unlock