A study on set-cordial labeling of graphs

For a non-empty ground set XX, finite or infinite, the set-valuation or set-labeling of a given graph GG is an injective function f:V(G)→P(X)f:V(G)→P(X), where P(X)P(X) is the power set of the set XX. In this paper, we introduce a new type of set-labeling, called set-cordial labeling and study the characteristics of graphs which admit the set-cordial labeling.

___

  • Acharya, B. D., Set-Valuations and Their Applications, MRI Lecture Notes in Applied Mathematics, The Mehta Research Institute of Mathematics and Mathematical Physics, Allahabad, 1983.
  • Bondy, J. A., Murty, U. S. R., Graph Theory, Springer, New York, 2008.
  • Brandstadt, A., Le, V. B., Spinrad, J. P., Graph Classes: A Survey, SIAM, Philadelphia, 1999.
  • Chen, C. C., Quimpo, N. F., On Strongly Hamiltonian Abelian Group Graphs, In: McAvaney K.L., Combinatorial Mathematics VIII, Lecture Notes in Mathematics, vol 884, Springer, Berlin, Heidelberg, 1981.
  • Deo, N., Graph Theory with Application to Engineering and Computer Science, Prentice Hall of India, New Delhi, 1974.
  • Gallian, J. A., A dynamic survey of graph labeling, Electron. J. Combin., 2020, # DS-6.
  • Harary, F., Graph Theory, Narosa Publications, New Delhi, 2001.
  • Rosa, A., On Certain Valuation of the Vertices of a Graph, Theory of Graphs, Gordon and Breach., Philadelphia, 1967.
  • Simmons, G. J., Almost All n-Dimensional Rectangular Lattices are Hamilton-Laceable, Proc. 9th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematica Publishing, 1978, 649-661.
  • Weisstein, E. W., CRC Concise Encyclopedia of Mathematics, CRC Press, Boca Raton, 2011.
  • West, D. B., Introduction to Graph Theory, Pearson Education, Delhi, 2001.
  • Information System on Graph Classes and Their Inclusions, http://www.graphclasses.org/smallgraphs.