On the Construction of the Reflexive Vertex k -Labeling of Any Graph with Pendant Vertex

I. H. Agustin, M. I. Utoyo, Dafik, M. Venkatachalam, Surahmat

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

A total k-labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k=maxke,2kv. A vertex irregular reflexivek-labeling of a simple, undirected, and finite graph G is total k-labeling, if for every two different vertices x and x′ of G, wtx≠wtx′, where wtx=fvx+Σxy∈EGfexy. The minimum k for graph G which has a vertex irregular reflexive k-labeling is called the reflexive vertex strength of the graph G, denoted by rvsG. In this paper, we determined the exact value of the reflexive vertex strength of any graph with pendant vertex which is useful to analyse the reflexive vertex strength on sunlet graph, helm graph, subdivided star graph, and broom graph.

Original languageEnglish
Article number7812812
JournalInternational Journal of Mathematics and Mathematical Sciences
Volume2020
DOIs
Publication statusPublished - 2020

Fingerprint

Dive into the research topics of 'On the Construction of the Reflexive Vertex k -Labeling of Any Graph with Pendant Vertex'. Together they form a unique fingerprint.

Cite this