PELABELAN TOTAL SISI AJAIB PADA HASIL KALI GRAF Pn C5 DENGAN n 2 SERTA PEMROGRAMANNYA DENGAN MENGGUNAKAN DELPHI 7.0
| Main Author: | MISWANTO, MISWANTO |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
, 2013
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/15738/ |
| ctrlnum |
15738 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><relation>http://eprints.umm.ac.id/15738/</relation><title>PELABELAN TOTAL SISI AJAIB PADA HASIL KALI GRAF Pn C5 DENGAN n 2 SERTA PEMROGRAMANNYA DENGAN MENGGUNAKAN DELPHI 7.0</title><creator>MISWANTO, MISWANTO</creator><subject>QA Mathematics</subject><description>Let graph G with vertices set V(G) and edges set E(G). If the vertices sum of graph G is m and edges sum is n, then the edge magic total labeling on a graph G defined by an injective function f:V(G)∪E(G)→{1,2,3,Â…,m+n} for every edges vw on G f(v)+f(vw)+f(w)=k, k is constant. Further more, k is called magic sum of graph G. The edge magic total labeling can do by two method, labeled the vertices first then the edges and labeled the edges first then the vertices.
Graph P_n×C_5 is Cartesian product of a path graph 〖(P〗_n) that has n vertices (with n≥2) with a cycle graph 〖(C〗_5) that has five vertices. The edge magic total labeling on graph P_n×C_5 with n≥2 by labeled the vertices first then the edges gives a magic sum k=15n-1. When label given by the edge first then the vertices gives a magic sum k=30n-11. To simply this edge magic total labeling, used the Delphi 7.0 programming which commonly made of control programming “if then” and “for to do”.</description><date>2013</date><type>Thesis:Thesis</type><type>PeerReview:NonPeerReviewed</type><identifier> MISWANTO, MISWANTO (2013) PELABELAN TOTAL SISI AJAIB PADA HASIL KALI GRAF Pn C5 DENGAN n 2 SERTA PEMROGRAMANNYA DENGAN MENGGUNAKAN DELPHI 7.0. Other thesis, University of Muhammadiyah Malang. </identifier><recordID>15738</recordID></dc>
|
| format |
Thesis:Thesis Thesis PeerReview:NonPeerReviewed PeerReview |
| author |
MISWANTO, MISWANTO |
| title |
PELABELAN TOTAL SISI AJAIB PADA HASIL KALI GRAF Pn C5 DENGAN n 2 SERTA PEMROGRAMANNYA DENGAN MENGGUNAKAN DELPHI 7.0 |
| publishDate |
2013 |
| topic |
QA Mathematics |
| url |
http://eprints.umm.ac.id/15738/ |
| contents |
Let graph G with vertices set V(G) and edges set E(G). If the vertices sum of graph G is m and edges sum is n, then the edge magic total labeling on a graph G defined by an injective function f:V(G)∪E(G)→{1,2,3,Â...,m+n} for every edges vw on G f(v)+f(vw)+f(w)=k, k is constant. Further more, k is called magic sum of graph G. The edge magic total labeling can do by two method, labeled the vertices first then the edges and labeled the edges first then the vertices.
Graph P_n×C_5 is Cartesian product of a path graph 〖(P〗_n) that has n vertices (with n≥2) with a cycle graph 〖(C〗_5) that has five vertices. The edge magic total labeling on graph P_n×C_5 with n≥2 by labeled the vertices first then the edges gives a magic sum k=15n-1. When label given by the edge first then the vertices gives a magic sum k=30n-11. To simply this edge magic total labeling, used the Delphi 7.0 programming which commonly made of control programming “if then” and “for to do”. |
| id |
IOS4109.15738 |
| institution |
Universitas Muhammadiyah Malang |
| institution_id |
136 |
| institution_type |
library:university library |
| library |
Perpustakaan Universitas Muhammadiyah Malang |
| library_id |
546 |
| collection |
UMM Institutional Repository |
| repository_id |
4109 |
| city |
MALANG |
| province |
JAWA TIMUR |
| repoId |
IOS4109 |
| first_indexed |
2017-03-21T02:43:26Z |
| last_indexed |
2017-03-21T02:43:26Z |
| recordtype |
dc |
| _version_ |
1675924220679290880 |
| score |
17.538404 |