Ter- dragon curve: a view in cordial and edge cordial labeling

Abstract

A fractal is a mathematical set that typically displays self-similar patterns. The Ter dragon curve is also a fractal in the family of √3 curve in brain filling curve models. There are many in this family of curves but for my study I have considered this fractal curve. This fractal has been considered as a graph and the same has been viewed under the cordial and edge cordial labeling to apply this curve with scope for further study.

Per-tiling, rep-tiling and Penrose tiling: a notion to edge cordial and cordial labeling

“…The construction of the graph is also part of the study of properties of the curve. Furthermore, for our study, the following definitions are to be reintroduced for clear understanding of this paper (Sathakathulla,[13]). A Graph G = <V, E, > consists of a non-empty set V called the set of nodes (points, vertices) of the graph, E is said to be the set of edges (may be empty) of the graph and  is the mapping from the set of edges E to a set of the ordered or unordered pair of elements of V. It would be convenient to write a graph G, as <V, E> or simply as G. A graph labeling is an assignment of integers to the vertices or edges, or both subject to certain conditions.…”