![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
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.
Subject Classification:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
