EMAIL: PASSWORD:
Front Office
UPT. PERPUSTAKAAN
Institut Teknologi Sepuluh Nopember Surabaya


Kampus ITS Sukolilo - Surabaya 60111

Phone : 031-5921733 , 5923623
Fax : 031-5937774
E-mail : libits@its.ac.id
Website : http://library.its.ac.id

Support (Customer Service) :
timit_perpus@its.ac.id




Welcome..guys!

Have a problem with your access?
Please, contact our technical support below:
LIVE SUPPORT


Moh. Fandika Aqsa


Davi Wahyuni


Tondo Indra Nyata


Anis Wulandari


Ansi Aflacha




ITS » Paper and Presentation » Matematika - S2
Posted by aprill@is.its.ac.id at 17/11/2015 09:21:54  •  1541 Views


PELABELAN TOTAL SUPER A D-SISI ANTI AJAIB PADA GRAF GABUNGAN SALING LEPAS S2 K0CN2K P3

SUPER a d-EDGE ANTIMAGIC TOTAL LABELING on DISJOINT UNION GRAPH of S2 k0Cn2k P3

Author :
APRILIA, IRA ( 1212201011 )




ABSTRAK

Pelabelan graf adalah suatu pemetaan fungsi bijektif yang memetakan himpunan dari elemen-elemen graf simpul dan atau sisi ke himpunan bilangan bulat positif. Pelabelan pada sebuah graf berkembang pesat dan melahirkan beragam jenis pelabelan. Salah satu jenis tipe pelabelan graf adalah pelabelan total super a d-sisi anti ajaib SEATL Super Edge Antimagic Total Labeling. SEATL pada sebuah graf G VE adalah fV f1 2 3 pg dan fE fp1 p2 pqg dengan p adalah banyaknya simpul dan q adalah banyaknya sisi pada graf G. Pada tesis ini dikaji pelabelan total super a d-sisi anti ajaib pada S2 k0Cn2k P3 untuk n 3 dan n bilangan bulat. Langkah awal dengan mengkonstruksi pelabelan menggunakan pendeteksian pola menentukan fungsi bijektif dengan konsep barisan aritmatika dan menentukan interval nilai beda d 2 f0 1 2g sehingga terdapat SEATL pada graf tersebut.


ABSTRACT

A labeling of a graph is a bijection mapping that assigns natural nnumbers to vertices andor edges of graph. Labeling of a graph is growing rapidly and produced various types of labeling. One of the types of graph labeling is super a d-edge antimagic total labeling SEATL. SEATL of graph G VE is fV f1 2 3 pg and fE fp 1 p 2 p qg for p to be the sum of the vertex labels and q to be the sum of the edge labels on graph G. In this paper we survey what is known about super a d-edge antimagic total labelings on S2 k0Cn2k P3 are mutually for n 3 n integers. For the first step is construct the labeling using pattern recognition then we continue to determine the bijective function using the concept of progression arithmetic and determine the interval value of d 2 f0 1 2g is possible so that it can perform there are labelings on disjoint union graph SEATL prism of non isomorphic.



Keywordsgraf prisma; gabungan graf non isomorfik; pelabelan total super sisi antimagic
 
Subject:  pelabelan graf
Contributor
  1. Dr. Darmaji, S.Si., M.T.
Date Create: 17/11/2015
Type: Text
Format: pdf
Language: Indonesian
Identifier: ITS-paper-12121150008192
Collection ID: 12121150008192
Call Number: RTMa 511.5 Apr p


Source
Paper and Presentations, Mathematics, RTMa 511.5 Apr p, 2015

Coverage
ITS Community

Rights
Copyright @2015 by ITS Library. This publication is protected by copyright and per obtained from the ITS Library prior to any prohibited reproduction, storage in a re transmission in any form or by any means, electronic, mechanical, photocopying, reco For information regarding permission(s), write to ITS Library




[ Download - Summary ]

ITS-paper-12121150008192-39575.pdf




 Similar Document...




! ATTENTION !

To facilitate the activation process, please fill out the member application form correctly and completely

Registration activation of our members will process up to max 24 hours (confirm by email). Please wait patiently

POLLING

Bagaimana pendapat Anda tentang layanan repository kami ?

Bagus Sekali
Baik
Biasa
Jelek
Mengecewakan





You are connected from 18.204.55.168
using CCBot/2.0 (https://commoncrawl.org/faq/)



Copyright © ITS Library 2006 - 2020 - All rights reserved.
Dublin Core Metadata Initiative and OpenArchives Compatible
Developed by Hassan