DocumentCode :
1782426
Title :
Irregular total labellings of Ladder
Author :
Mominul Haque, K.M. ; Khanam, Umme Narseen
Author_Institution :
Dept. of Comput. Sci. & Eng., Sylhet Int. Univ., Sylhet, Bangladesh
fYear :
2014
fDate :
8-10 March 2014
Firstpage :
502
Lastpage :
505
Abstract :
The total edge irregularity strength tes(G) and total vertex irregularity strength tvs(G) are invariants analogous to irregular strength s(G) of a graph G for total labellings. Bača et al. [Discrete Mathematics, 307: 1378-1388, (2007)] determined the bounds and precise values for some families of graphs concerning these parameters. In this paper, we show the exact values of the total edge irregularity strength tes (Ln)= n total vertex irregularity strength and tvs(Ln) = ⌊n/2 ⌋ + 1 for the Ladder Ln.
Keywords :
graph theory; graph; irregular total labellings; ladder; total edge irregularity strength tes; total vertex irregularity strength tvs; Computer science; Computers; Educational institutions; Graph theory; Information technology; Labeling; Irregular total labelling; Ladder Graphs; Total labeling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Technology (ICCIT), 2013 16th International Conference on
Conference_Location :
Khulna
Type :
conf
DOI :
10.1109/ICCITechn.2014.6997317
Filename :
6997317
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1782426
بازگشت