Mulyono, - The total irregularity strength of caterpillars with odd number of internal vertices of degree three. Journal of Physics: Conference Series.

	PDF Download (830kB)
	PDF (Turnitin) Download (1MB)

Abstract

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 k-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 for which has totally irregular total k-labelling as total irregularity strength of , ts(). 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: + 2 if the caterpillars have q=5 internal vertices, + 3 for q=7, and + 4 for q=9.

Actions (login required)

View Item