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

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

International Journal of Mathematics and Mathematical Sciences, 2020, vol. 2020, 1-8

Abstract:

A total - labeling is a function from the edge set to first natural number and a function from the vertex set to non negative even number up to , where . A vertex irregular reflexive -labeling of a simple, undirected, and finite graph is total - labeling, if for every two different vertices and of , , where . The minimum for graph which has a vertex irregular reflexive - labeling is called the reflexive vertex strength of the graph , denoted by . 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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2020/7812812.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2020/7812812.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:7812812

DOI: 10.1155/2020/7812812

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().