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

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    A fractal is a complex geometric figure that continues to display self-similarity when viewed on all scales. A simple, yet unifying method is provided for the construction of tiling by tiles obtained from the attractor of an iterated function system (IFS). This tiling can be used to extend a fractal transformation on the entire space upon which the IFS acts. There are many in this family of tiling fractals curves but for my study, I have considered each one from the above family of tiling fractals. These fractals have been considered as a graph and the same has been viewed under the scope of cordial and edge cordial labeling to apply this concept for further study.


  • Keywords


    Tiling; Fractals; Graph Labeling; Cordial and Edge Cordial.

  • References


      [1] Bandt, C. and Gummelt, P. Fractal Penrose Tilings I. Construction and matching rules. Aequationes Mathematicae, vol. 53, Numbers 1-2, Feb. 1997.

      [2] Bloom G. S. and Golomb S. W. (1977). Applications of numbered undirected graphs, Proc of IEEE, 65 (4), 562-570. http://dx.doi.org/10.1109/PROC.1977.10517.

      [3] Cahit I. (1987). Cordial Graphs: A weaker version of graceful and harmonious Graphs, Ars Combinatoria, 23,201-207.

      [4] Gallian, J. A. (2009). A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 16, #DS 6.

      [5] Gelbrich, G. Fractal Penrose Tiles II: Tiles with fractal boundary as duals of penrose tiles. Aequationes Mathematicae, vol. 54, Numbers 1-2, Aug. 1997.

      [6] Harary, F. (1972). Graph Theory, Massachusetts, Addison Wesley.

      [7] James Gleick, Chaos, Vintage Publishers, 1998.

      [8] Jeffrey Ventrella (2012) Brainfilling Curves - A Fractal Bestiary, Lulu.com.

      [9] Karzes, T. Tiling Fractal curves published online at: http://karzes.best.vwh.net.

      [10] M. Barnsley, Fractals Everywhere, Academic Press Inc., 1988.

      [11] M. Seoud and A. E. I. Abdel Maqsoud, “On cordial and balanced labelings of graphs”, Journal of Egyptian Math. Soc., Vol. 7, pp. 127-135, 1999.

      [12] R. Devaney and L. Keen, eds., Chaos and Fractals: The Mathematics behind the Computer Graphics, American Mathematical Society, Providence, RI, 1989. http://dx.doi.org/10.1090/psapm/039.

      [13] Sathakathulla A.A., Ter- dragon curve: a view in cordial and edge cordial labeling, International Journal of Applied Mathematical Research, 3 (4) (2014) 454-457. http://dx.doi.org/10.14419/ijamr.v3i4.3426.

      [14] Sundaram M., Ponraj R. and Somasundram S. (2005). Prime Cordial Labeling of graphs, J.Indian Acad. Math., 27(2), 373-390.


 

View

Download

Article ID: 4413
 
DOI: 10.14419/ijamr.v4i2.4413




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.