On The Total Irregularity Strength of Regular Graphs

Rismawati Ramdani, A.N.M. Salman, Assiyatun Assiyatun Β· Journal of Mathematical and Fundamental Sciences Β· 2015

Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 βˆͺ 𝐸 β†’ {1, 2, β‹― , π‘˜} iscalled a totally irregular total π‘˜-labeling of 𝐺 if every two distinct vertices π‘₯ and𝑦 in 𝑉 satisfy 𝑀𝑓(π‘₯) β‰  𝑀𝑓(𝑦) and every two distinct edges π‘₯1π‘₯2 and 𝑦1𝑦2 in 𝐸satisfy 𝑀𝑓(π‘₯1π‘₯2) β‰  𝑀𝑓(𝑦1𝑦2), where 𝑀𝑓(π‘₯) = 𝑓(π‘₯) + Ξ£π‘₯π‘§βˆˆπΈ(𝐺) 𝑓(π‘₯𝑧) and𝑀𝑓(π‘₯1π‘₯2) = 𝑓(π‘₯1) + 𝑓(π‘₯1π‘₯2) + 𝑓(π‘₯2). The minimum π‘˜ for which a graph 𝐺 hasa totally irregular total π‘˜-labeling is called the total irregularity strength of 𝐺,denoted by 𝑑𝑠(𝐺). In this paper, we consider an upper bound on the totalirregularity strength of π‘š copies of a regular graph. Besides that, we give a dual labeling of a totally irregular total π‘˜-labeling of a regular graph and we consider the total irregularity strength of π‘š copies of a path on two vertices, π‘š copies of a cycle, and π‘š copies of a prism 𝐢𝑛 β–‘ 𝑃2.

Read the paper Β· More papers on PaperTik