Volume 4, Issue 4, December 2019, Page: 45-50
Signed Product Cordial of the Sum and Union of Two Fourth Power of Paths and Cycles
Shokry Nada, Department of Mathematics, Faculty of Science, Menoyfia University, Cairo, Egypt
Amani Elrayes, Institute of National Planning, Cairo, Egypt
Ashraf Elrokh, Department of Mathematics, Faculty of Science, Menoyfia University, Cairo, Egypt
Aya Rabie, Institute of National Planning, Cairo, Egypt
Received: Jun. 15, 2019;       Accepted: Aug. 12, 2019;       Published: Dec. 30, 2019
DOI: 10.11648/j.mlr.20190404.11      View  495      Downloads  83
A simple graph is said to be signed product cordial if it admits ±1 labeling that satisfies certain conditions. Our aim in this paper is to contribute some new results on signed product cordial labeling and present necessary and sufficient conditions for signed product cordial of the sum and union of two fourth power of paths. We also study the signed product cordiality of the sum and union of fourth power cycles The residue classes modulo 4 are accustomed to find suitable labelings for each class to achieve our task. We have shown that the union and the join of any two fourth power of paths are always signed product cordial. Howover, the join and union of fourth power of cycles are only signed codial with some expectional situations.
Fourth Power, Sum Graph, Union Graph, Signed Product Cordial Graph, AMS Classification: 05C78, 05C75, 05C20
To cite this article
Shokry Nada, Amani Elrayes, Ashraf Elrokh, Aya Rabie, Signed Product Cordial of the Sum and Union of Two Fourth Power of Paths and Cycles, Machine Learning Research. Vol. 4, No. 4, 2019, pp. 45-50. doi: 10.11648/j.mlr.20190404.11
Copyright © 2019 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
A. Balaban, "Application of Graph Theory in Chemistry", Journal of Chemical Information and Computer Science, 334-343 (2019).
I. Cahit, Cordial Graphs. A weaker version of graceful and harmonious Graphs, Ars Combinatoria, 23: 201-207 (1987).
A. Chakraborty, T. Dutta, S. Mondal, and A. Nath, "Application of Graph Theory in Social Media", International Journal of Computer Sciences and Engineering, vol. -6, 722-729 (2018).
J. Devaraj and P. Delphy. On signed cordial graph, Int. J. of Mathematical Sciences and Applications, Vol. 1, No. 3, September 1156-1167 (2011).
A. T. Diab, Study of some problems of cordial graphs, Ars Combin, 92, 255-261 (2009).
A. T. Diab, Generalization of some results on cordial graphs, Ars Combin, 99, 161-173 (2011).
F. Farahani, W. Karwski, and N. R. Lighthall, "Application of Graph Theory for Identifing Connectivity Patterns in Human Brain Network: A S ystematic Review", frontiers in Neuroscience, (2019).
J. A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, DS6, (2014).
A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs (Internat. Symposium, Rome, July 1996), Gordon and Breach, N. Y. and Dunod Paris 349- 355, (1967).
P. Sumathi, A. Mahalakshmi, "Quotient-3 Cordial Labeling for Path Related Graphs", Applied Mathematics and Scientific Computing, 555-561 (2019).
M. Sundaram, R. Ponraj, and S. Somasundaram, Product cordial labeling of graph, Bulletin of Pure and Applied Science, vol. 23, 155-163, (2004).
R. Ponraj, K. Annathurai and R. Kala, "Remainder Cordiality of some Graphs", Palestine Journal of Mathematics, Vol. 8 (1), 367-372 (2019).
Browse journals by subject