Volume 15 - Issue 1
Cycle Related Perfect Mean Cordial Graph
Abstract
A vertex labeling fâśV(G) â{ 0,1,2,3} is said to be perfect mean cordial labeling of a graph G if it induces an edge labeling fâ defined as follows: đđâ(đ˘đ˘đ˘đ˘) = ô 1 đđđ 2|(đđ(đ˘đ˘)+đđ(đŁ ))0 đđđđâđđđđđđđ đđđđ
Paper Details
PaperID: 191021
Author's Name: A. Annie Lydia and M.K. Angel Jebitha
Volume: Volume 15
Issues: Issue 1
Keywords: Perfect Mean Cordial Graph, Perfect Mean Cordial Labeling.
Year: 2019
Month: February
Pages: 176-182
