Affiliation:
1. Christ University, Bangalore, India
Abstract
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.
Publisher
Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics
Reference12 articles.
1. 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.
2. Bondy, J. A., Murty, U. S. R., Graph Theory, Springer, New York, 2008.
3. Brandstadt, A., Le, V. B., Spinrad, J. P., Graph Classes: A Survey, SIAM, Philadelphia, 1999.
4. 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.
5. Deo, N., Graph Theory with Application to Engineering and Computer Science, Prentice Hall of India, New Delhi, 1974.