Cordiality in the Context of Duplication in Quadrilateral Snake Graph

U. M. Prajapati¹ , Rohoullah Asad² , R. M. Gajjar³

Section:Research Paper, Product Type: Journal-Paper
Vol.10 , Issue.5 , pp.22-25, Oct-2023

Online published on Oct 31, 2023

Copyright © U. M. Prajapati, Rohoullah Asad, R. M. Gajjar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
Let G = (V(G),E(G)) be a graph and let g? V(G) ? {0,1} be a mapping from the set of vertices to {0,1} and for each edge uv ? E assign the label | g(u)- g(v)|. If 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, then f is called a cordial labeling. We discuss cordial labeling of graphs obtained from duplication of certain graph elements in quadrilateral snake graphs.

Key-Words / Index Term :
Graph Labeling, Cordial Labeling, Cordial Graph, Quadrilateral Snake Graph.

References :
[1] V. Ramachandran and C. Sekar, “One modulo N gracefulness of n-polygonal-snakes, C_n^((t)) and P_(a,b)”, Internat. J. Engineering Res. and tech., (IJERT), Vol.2, issue.10, pp.3514-3529.
[2]. S. K. Vaidya and C. M. Barasara, “Product Cordial graph in context of some graph operations”, J. Math. Comput. Sci. Vol.1, issue.2, pp.1-6, 2011.
[3] S. K. Vaidya and N. A. Dani, “Cordial and 3-Equitable Graphs Induced by Duplication of Edge”, Mathematics Today, 27, pp.71-82, 2011.
[4] I. Cahit, “Cordial Graphs: A weaker version of graceful and harmonious Graphs”, Ars Combinatoria, 23, pp.201-207, 1987.
[5] D. B. West, “Introduction to Graph Theory”, Prentice-Hall of India, New Delhi (2001).
[6] J.A. Gallian, “A Dynamic Survey of Graph Labeling”, The Electronic Journal of Combinatorics 25, 2022.
[7] J. Gross and J. Yellen, “Graph Theory and Its Applications”, CRC Press, Boca Raton, 1999.
[8]. U.M. Prajapati and R. M. Gajjar, “Cordial Labeling of Complement of some Graph”, Mathematics Today, 30, pp.99-118, 2015.
[9]. U.M. Prajapati and R. M. Gajjar, “Cordial Labeling in the Context of Duplication of some Graph Elements”, International Journal of Mathematics and Soft Computing, Vol.6, No.2, pp.65 – 73, 2016.