| Paper title: |
Cordial Languages and Cordial Numbers |
| Published in: | Issue 2, (Vol. 6) / 2012 |
| Publishing date: | 2011-10-24 |
| Pages: | 9-12 |
| Author(s): | BABUJEE J. Baskar, SHOBANA L. |
| Abstract. | The concept of cordial labeling in graphs motivated us to introduce cordial words, cordial languages and cordial numbers. We interpret the notion of cordial labeling in Automata and thereby study the corresponding languages. In this paper we develop a new sequence of numbers called the cordial numbers in number theory using the labeling techniques in graph theory on automata theory. |
| Keywords: | Graphs, Paths, Cycles, Labeling, Automata, Languages, Binary. |
| References: | 1. J.Baskar Babujee, J.Julie, Special Automata from Graph Structures, Proceeding of the International Conference on Mathematics and Computer Science, (2011), 135-137. 2. I. Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars Combin., 23 (1987) 201-207. 3. John. E. Hopcroft and Jeffery. D. Ullman, Introduction to Automata theory, Languages and computation, Narosa Publishing House, 1987. 4. K.R.Parthasarathy, Basic Graph Theory, Tata McGraw-Hill. Publishing Company Ltd., New Delhi (1994). |
| Back to the journal content | |
