SEATL Application in Determining IP Addresses on the quantity of a Computer LAN
Abstract
IP address is a numerical identification were assigned to a device such as a computer, router or printer are contained in a computer network that uses the Internet protocol for communication. Each computer must have an IP address that is to be kept secret. To determine IP address we can use a methods, the method use Super edge anti magic (SEATL). Super edge anti magic total labeling of G graph is bijective function with the property that the edge-weights form an arithmetic progression where a>0 and d ? 0 are two fixed integers. ), form an arithmetic sequence with firstterm a and common difference d. Such a graph G is called super if the smallest possiblelabels appear on the vertices. In this paper we study about methods to develop code tag and detect a number of IP Address on computer setup.
References
A. Gallian. 2013. A Dinamic Survey Of Graph Labeling. Jember: Gallian Survey.124-128.
A. Gallian. 2013. A Dinamic Survey Of Graph Labeling. Jember: Gallian Survey.124-128
Dafik, Alfin Fajriatin, Kunti Mila Diyah. 2012. Super anti magicness of a Well Defined Graph. (Saintifika,vol.14No1hal106-118).
Griffin, C. 2012. Graph Theory. United Stated: Creative Commons Attribution Noncommercial Share
J. Baugh, Richard. 2009. Discrete Mathematics, seventh edition. New Jersey: Pearson Education, Inc
K. A. Sugeng, M. Millerand M. Baca, Super edge-anti magic total labelings, Utilitas Math., 71(2006),131-141.
Lee, Ming-ju. 2013. On Super (a,1)-edge Antimagic Total Labelings Of Subdifition Of Stars. Miaoli: Jen-The Junior CollageOfMadicine.1-10.
M. Ba?ca, Y. Lin, M. Millerand R.Simanjuntak,New constructionsf magic and anti magic graph labelings, Utilitas Math. 60(2001), 229–239.
R. M. Figueroa-Centeno, R.Ichishima, F. A. Muntaner-Batle, The place of super edge-magic labeling among at her classes of labelings, Discrete Mathematics, 231 (2001),153-168.
R. Simanjuntak, F. Bertaultan M. Miller, Twonew (a,d)-anti magic graph labelings, Proc. Of Eleventh Australasian Workshop on Combinatorial Algorithms- (2000),179–189
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2017 Jurnal Axioma : Jurnal Matematika dan Pembelajaran
This work is licensed under a Creative Commons Attribution 4.0 International License.