×

Cordial labeling of corona product between paths and fourth power of paths. (English) Zbl 1538.05280

Summary: A simple graph is said to be cordial if it admits 0-1 labeling that satisfies certain conditions. In this paper we investigate necessary and sufficient conditions for cordial labeling of the corona product between paths and fourth power of paths be cordial.

MSC:

05C78 Graph labelling (graceful graphs, bandwidth, etc.)
05C76 Graph operations (line graphs, products, etc.)

References:

[1] A. Rosa, On Certain Valuations of the Vertices of a Graph, Theory of Graphs (Internat Symposium, Rome, July 1966), Gordon and Breach, N. Y. Dunod Paris, 1967, 349-355. · Zbl 0193.53204
[2] B. D. Acharya, S. M. Hegde, Arithmetic Graphs, J. Graph Theory, 14(3), (1990), 275-299. · Zbl 0735.05071
[3] I. Cahit, Cordial Graphs: A Weaker Version of Graceful and Harmonious Graphs, Ars Combinatoria, 23, (1987), 201-207. · Zbl 0616.05056
[4] I. Cahit, On Cordial and 3-eqtitable Labeling of Graphs, Utiliuies Math, 37, (1990). · Zbl 0714.05053
[5] I. Cahit, On Cordial Labeling of the Second Power of Paths with other Graphs, ARS Combinatoria, 97A, (2010), 327-343. · Zbl 1249.05336
[6] J. A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combi-natorics, DS6, (2017).
[7] S. Freeda, S. R. Chellathurai, H 1 and H 2 Cordial Labeling of Some Graphs, Open J. Discrete Math, 2, (2012), 149-155.
[8] S. I. Nada, A. T. Diab, A. Elrokh, D. E. Sabra, The Corona between Paths and Cycles, Ars Combin, accepted. · Zbl 1474.05351
[9] V. Yegnanarayanan, P. Vaidhyanathan, Some Interesting Applications of Graph La-bellings, Journal of Mathematical and Computational Science, 2(5), (2012), 1522-1531. [ DOI: 10. · Zbl 1538.05280 · doi:10.61186/ijmsi.18.2.107
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.