Please use this identifier to cite or link to this item:
Title: 3−Remainder Cordial Labeling of Cycle Related Graphs
Authors: Annathurai, K
Ponraj, R
Kala, R
Keywords: Web graph
Butterfly graph
Umbrella graph
Dragon graph
Issue Date: 6-Jun-2019
Publisher: Vidyasagar University , Midnapore , West Bengal , India
Series/Report no.: Journal of Physical Sciences;JPS-v24-art14
Abstract: Let G be a (p, q) graph. Let f be a function from V (G) to the set {1, 2, . . . , k} where k is an integer 2 < k ≤ |V (G)|. For each edge uv assign the label r where r is the remainder when f(u) is divided by f(v) (or) f(v) is divided by f(u) according as f(u) ≥ f(v) or f(v) ≥ f(u). Then the function f is called a k-remainder cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, . . . , k} where vf (x) denote the number of vertices labeled with x and |ηe – ηo| ≤ 1 where ηe and ηo respectively denote the number of edges labeled with an even integers and number of edges labeled with an odd integers. A graph admits a k-remainder cordial labeling is called a k- remainder cordial graph. In this paper we investigate the 3- remainder cordial labeling behavior of the Web graph, Umbrella graph, Dragon graph, Butterfly graph, etc.
ISSN: 2350-0352
Appears in Collections:Journal of Physical Sciences Vol.24 [2019] (Special Issue)

Files in This Item:
File Description SizeFormat 
JPS-v24-art14.pdf76.29 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.