ON TOTAL VERTEX IRREGULARITY STRENGTH OF SOME CLASSES OF TADPOLE CHAIN GRAPHS

A total k-labeling f that assigns V ∪ E into {1, 2, . . . , k} on graph G is named vertex irregular if wtf(u) ̸= wtf(v) for dissimilar vertices u,v in G with the weights wtf (u) = f(u) + ux∈E(G) f(ux). We call the minimum number k utilized in total labeling f as a total vertex irregularity strength...

Full description

Saved in:
Bibliographic Details
Published in:TWMS journal of applied and engineering mathematics 2021-01, Vol.11 - Special Issue (Jaem Vol 11 - Special Issue, 2021), p.133
Main Authors: Rosyida, I, Indriati, D
Format: Article
Language:English
Subjects:
Apexes
Chains
Graphs
Irregularities
Labeling
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A total k-labeling f that assigns V ∪ E into {1, 2, . . . , k} on graph G is named vertex irregular if wtf(u) ̸= wtf(v) for dissimilar vertices u,v in G with the weights wtf (u) = f(u) + ux∈E(G) f(ux). We call the minimum number k utilized in total labeling f as a total vertex irregularity strength of G, symbolized by tvs(G). In this research, we focus on tadpole chain graphs that are chain graphs which con- tain tadpole graphs in their blocks. We investigate tvs of some classes of tadpole chain graphs,. i.e., Tr(4,n) and Tr(5,n) with length r. Some formulas are derived as follows:
ISSN:2146-1147