On the vertex irregular reflexive labeling of several regular and regular-like graphs. (4th July 2022)

• Record Type: Journal Article
• Authors: Agustin, Ika H.; Susilowati, Liliek; Dafik, ; Cangul, Ismail N.; Mohanapriya, N.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 25:Number 5(2022)
• Page Start: 1457
• Page End: 1473
• Publication Date: 2022-07-04
• Subjects: 05C78; Regular graph -- Almost regular graph -- Regular-like graph -- Irregular reflexive k-labeling -- Reflexive vertex strength; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2022.2063543
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A total k -labeling is defined as a function g from the edge set to the first natural number ke and a function f from the vertex set to a non-negative even number up to 2 kv, where k = max { ke, 2 kv }. A vertex irregular reflexive k-labeling of the graph G is total k -labeling if wt ( x ) ¹ wt ( x ¢) for every two different vertices x and x ¢ of G, where wt ( x ) = f ( x ) + Σ xy ∈ E ( G ) g ( xy ). The reflexive vertex strength of the graph G, denoted by rvs ( G ), is the minimum k for a graph G with a vertex irregular reflexive k -labeling. We will determine the exact value of rvs ( G ) in this paper, where G is a regular and regular-like graph. A regular graph is a graph where each vertex has the same number of neighbors. A regular graph with all vertices of degree r is called an r -regular graph or regular graph of degree r . A regular-like graphs is an almost regular graph that we develop in a new definition and we called it with ( s, r ) -almost regular graphs.