Some general results on restricted k-mean graph. (18th May 2020)

• Record Type: Journal Article
• Authors: Gayathri, B.; Gopi, R
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 23:Number 4(2020)
• Page Start: 901
• Page End: 911
• Publication Date: 2020-05-18
• Subjects: 05C78; Restricted k-mean Labeling -- Restricted k-mean graph; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1630936
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A graph G = ( p, q ) is said to have a restricted k -mean labeling if there is an injective function f from the vertices of G to { k – 1, k, k + 1, … , k + q – 1} such that when each edge uv is labeled with then the resulting edge labels { k, k + 1, k + 2, … , k + q – 1} are all distinct where k is a positive integer greater than or equal to one. A graph that admits a restricted k -mean labeling is called a restricted k -mean graph.