Total views : 319

The Total Edge Irregular Labeling of Network Constructed by Some Copies of Cycle on Three Vertices Corona a Vertex

Affiliations

  • Mathematics Department, Mathematics and Natural Sciences Faculty, Hasanuddin University,Makassar, Indonesia
  • Mathematics Department, Mathematics and Natural Sciences Faculty, Hasanuddin University, Makassar, Indonesia

Abstract


Many networks have been found the total edge irregularity strength’s. The aim of this paper is determined the total edge irregularity strength of network constructed by some copies of cycle on three vertices corona a vertex. The results of this paper that the total edge irregularity strength of network constructed by some copies of cycle on three vertices corona a vertex is 2m+1 for m>2 where m is the number copies of cycle on three vertices.

Keywords

Corona Product of Graph, Irregular Labeling, Irregularity Strength.

Full Text:

 |  (PDF views: 303)

References


  • Ahmad A, Ba a M. Total edge irregularity strength of a categorical product of two paths, Ars Combin. 2014; 114:203–12.
  • Ahmad A, Ba a M. Edge-irregular total labeling of certain family of graphs. AKCE J Graphs Combin. 2009; 6(1):21–9.
  • Aigner M, Triesch E. Irregular assignments of trees and forests. SIAM J Discrete Math. 1990; 3:439–49.
  • Amar D, Togni O. Irregularity strength of trees. Discrete Math. 1998; 190:15–38.
  • Ba a M, Jendrol' S, Miller M, Ryan J. On irregular total labellings. Discrete Math. 2007; 307:1378–88.
  • Bohman T, Kravitz D. On the irregularity strength of trees. J Graph Theory. 2004; 45:241–54.
  • Cammack LA, Schelp RH, Schrag GC. Irregularity strength of full d-ary trees. Congr Numer. 1991; 81:113–9.
  • Chartrand G, Jacobson MS, Lehel J, Oellermann OR, Ruiz S, Saba F. Irregular networks. Congr Numer. 1988; 64:197–210.
  • Gallian JA. Dynamic survey of Graph labeling. Electron J Combin. 2015.
  • Ivan o J, Jendrol' S. Total edge irregularity strength of trees. Discuss Math. 2006; 26:449–56.
  • Jendrol' S, Mi kuf J, Soták R. Total edge irregularity strength of complete graphs and complete bipartite graphs. Discrete Math. 2010; 310:400–7.
  • Mi kuf J, Jendrol' S. On total edge irregularity strength of the grids. Tatra Mt Math Publ. 2007; 36:147–51.
  • Nurdin. The total edge and vertex irregularity strength of nC3 - snake. Far East Journal of Mathematical Sciences. 2013; 78(2):205–10.
  • Nurdin, Salman AMN, Baskoro ET. The total edge-irregular strengths of the corona product of paths with some graphs. J. Combin, Math Combin Comput. 2008; 65:163–75.
  • Hinding N, Suardi N, Basir H. Total edge irregularity strength of subdivision of star. Journal of Discrete Mathematical Sciences and Cryptography. 2015; 18(6):869–75.
  • Siddiqui MK, Nurdin, Baskoro ET. Total edge irregularity strength of the disjointunion of helm graphs. J Math Fund Sci. 2012; 45(2):163–71.
  • Wallis WD. Magic graphs. Boston: Birkhäuser; 2001.

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.