Determining total vertex irregularity strength of Tr(4, 1) tadpole chain graph and its computation

Open

Isnaini Rosyida, Mulyono, Diari Indriati

2019 Procedia Computer Science Vol. 157 Conference paper Cited by 8 Quartile

Abstract

In this research, we examine total vertex irregularity strength (tvs) of tadpole chain graph Tr(4, 1) with length r. We obtain that tvs (Tr(4, 1)) = [ 4r5+ 2 ] . Further, we construct algorithm to determine label of vertices, label of edges, weight of vertices, and the exact value of tvs of Tr(4, 1). © 2019 The Authors. Published by Elsevier B.V.

Affiliations

Mathematics Department, Universitas Negeri Semarang, Indonesia; Mathematics Department, Universitas Sebelas Maret, Surakarta, Indonesia