Let G = (V, E) be a graph. The binary numbers 0 and 1 have been allotted to the edges of the graph G through the evaluating functions defined on V and E by ensuring the cordiality conditions. This has been obtained through the prime and the Narayana numbers. Any graph G which admits this labeling is known as Narayanaprime cordial graph. In this research paper , we compute the Narayana prime cordial labeling of Grid graphs.
Topics
Narayana numbers
REFERENCES
1.
B. D.
Acharya
and S. M.
Hegde
, Arithmetic graphs, J. Graph Theory
14
(3
), 275
–299
(1990
).2.
A. Asha
Rani
, K.
Thirusangu
, B.J.
Murali
and A.
Manonmani
, Narayana Prime Cordial Labeling of Generalized Petersen Graph
, Malaya Journal of Matematik
S
(1
), 1
–5
(2020
).3.
B. J.
Balamurugan
, K.
Thirusangu
, B. J.
Murali
and J.
VenkateswaraRao
, Computation of Narayana Prime Cordial Labeling of Book Graphs
, Applied Mathematics and Scientific Computing
, 547
–553
(2019
).4.
B. J.
Balamurugan
, K.
Thirusangu
and B. J.
Murali
, Computing Narayana Prime Cordial Labeling of Web Graphs and Flower Graphs
, Ambient Communications and Computer Systems
, 411
–419
(2019
).5.
M.
Bona
and B.E.
Sagan
, On divisibility of Narayana numbers by primes
, J. Integer Sequences
8
(2005
).6.
I.
Cahit
, Cordial graphs: a weaker version of graceful and harmonics graphs
, ArsCombin.
23
, 201
–207
(1987
).7.
8.
9.
10.
N. Lakshmi
Prasana
, K.
Saravanthi
and N.
Sudhakar
, Applications of graph labeling in major areas of computer science
, Int. J. Res. Comput. Commun. Technol.
3
(8
) (2014
).11.
B. J.
Murali
, K.
Thirusangu
and B. J.
Balamurugan
, Narayana prime cordial labeling of graphs
, Int. J. Pure Appl. Math.
117
(13
), 1
–8
(2017
).12.
A.
Rosa
, “On certain valuations of the vertices of a graph,” in: Theory of graphs, Internat. Sympos. Rome
: 349
–359
(1967
) Gordan and Breach
. Newyork. Dunod, Paris
(1966
).13.
S.
Venkatesh
and B. J.
Balamurugan
, Narayana Prime Cordial Labeling of Complete Graph and Complete Bipartite Graph
, International Journal of Engineering and Advanced Technology
9
(1S3
) (2019
).
This content is only available via PDF.
© 2020 Author(s).
2020
Author(s)
You do not currently have access to this content.