| Title: |
CYCLE RELATED GRAPHS - NEAR MEAN CORDIAL. |
| Authors: |
PANDISELVI, L.; PALANI, K. |
| Source: |
Turkish Online Journal of Qualitative Inquiry; 2021, Vol. 12 Issue 7, p6470-6474, 5p |
| Subject Terms: |
TESTUDINIDAE |
| Abstract: |
Let G = (V, E) be a simple graph. A Near Mean Cordial Labeling of G is a function in f: V(G) - {1, 2, 3,. . ., p-1, p+1} such that the induced map f* defined by f* (uv) = { 1 if(f(u) + f(v)) = 0 (mod2) 0 else and it satisfies the condition |ef(0)- ef(1)|= 1, where ef(0) and ef(1) represent the number of edges labeled with 0 and 1 respectively. A graph is called a Near Mean Cordial Graph if it admits a near mean cordial labeling. In this paper, It is to be proved that, Tortoise graph Tn and Snail graph Snare Near Mean Cordial graphs. [ABSTRACT FROM AUTHOR] |
| : |
Copyright of Turkish Online Journal of Qualitative Inquiry is the property of Turkish Online Journal of Qualitative Inquiry and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |