Cycle Related Mean Square Cordial Graphs
Abstract
Let G = (V,E) be a graph with p vertices and q edges. A Mean Square Cordial Labeling of a
Graph G with vertex set V is a bijection from V to {0, 1} such that each edge uv is assigned the label
( ⌈(
Downloads
Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.
