Contact: +91-9711224068
• Multidisciplinary Journal
• Printed Journal
• Indexed Journal
• Refereed Journal
• Peer Reviewed Journal

ISSN Print: 2394-7500, ISSN Online: 2394-5869, CODEN: IJARPF

# Vol. 1, Issue 11, Part B (2015)

Special Class of Mean Square Cordial Graphs

## Special Class of Mean Square Cordial Graphs

Author(s)
A.Nellai Murugan, S.Heerajohn
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 ( ( ⌈(〖f(u))〗^2+(〖f(u))〗^2⌉ ))⁄2 where ⌈x⌉ (ceilex) is the least integer greater than or equal to x with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. The graph that admits a Mean Square Cordial Labeling is called Mean Square Cordial Graph. In this paper, we proved that the graphs Tree Tr(n), Umbrella U(n,3), Twig Tgn are Mean Square Cordial Graphs.
Pages: 128-131  |  1122 Views  67 Downloads
How to cite this article:
A.Nellai Murugan, S.Heerajohn. Special Class of Mean Square Cordial Graphs. Int J Appl Res 2015;1(11):128-131.
###### Important Publications Links

International Journal of Applied Research