[
ABSTRAKMisalkan graf ( ) sering ditulis sebagai , terdiri dari himpunan tak kosong simpul dan himpunan busur . Penambahan busur pada graf Tangga ( ) yang diperluas, akan mengakibatkan diperolehnya suatu graf baru. Graf Tangga ( ) adalah hasil perkalian Cartesius graf lintasan . Pada tesis ini dipelajari variasi dua graf tangga yaitu : graf Tangga Segitiga dan graf Tangga Segitiga Variasi . Pelabelan harmonis sesuai dari definisi Graham dan Sloane (1980) adalah fungsi injektif ( ) , yang menginduksi fungsi pelabelan busur bijektif ( ) dimana ( ) ( ) ( )( | |) Pada tesis ini dibuktikan bahwa graf dan graf untuk merupakan graf harmonis.
ABSTRACTLet ( ), in short , be a graph which consists of a non empty set of vertices and a set of edges . By adding several edges in Ladder graph ( ), we can obtain a new graph. A Ladder graph ( ) is a graph product between two paths . In this tesis, we study on the construction of harmonious labeling of Triangular Ladder graph and Variation of Trianguler Ladder graph . A harmoniuous labeling, referred to Graham and Sloane ( 1980 ), is an injective function ( ) , which will induced bijection edge function ( ) where ( ) ( ) ( )( | |). In this tesis, it will be proved that graph and graph for is harmoniuous graphs, Let ( ), in short , be a graph which consists of a non empty set of vertices and a set of edges . By adding several edges in Ladder graph ( ), we can obtain a new graph. A Ladder graph ( ) is a graph product between two paths . In this tesis, we study on the construction of harmonious labeling of Triangular Ladder graph and Variation of Trianguler Ladder graph . A harmoniuous labeling, referred to Graham and Sloane ( 1980 ), is an injective function ( ) , which will induced bijection edge function ( ) where ( ) ( ) ( )( | |). In this tesis, it will be proved that graph and graph for is harmoniuous graphs]