Super vertex-magic total labeling on cycles and complete graphs.
(Universitas Indonesia, 2005)
|
| One of the methods for labeling graphs is super vertex-magic total labeling. If G is a finite simple graph with v vertices and e edges, a vertex-magic total labeling is a labeling of vertices and edges of G with the property that the weight of each vertex is equal to a constant k. Such a labeling is super vertex-magic total labeling if the smallest labels are assigned to the vertices. This skripsi presents basic properties of such labeling; discuss the properties of regular graphs: cycles and complete graphs that admits super vertex-magic total labeling, and shows some graphs that do not have super vertex-magic total labeling. Keywords: super vertex-magic total labeling, regular graphs, cycles and complete graphs viii + 38 pages.; fig.; tab. Bibliography: 9 (1969 ? 2004) |
 S27608-Ribhan Y. Pratomo.pdf :: Unduh
|
| No. Panggil : | S27608 |
| Subjek : | |
| Penerbitan : | [Place of publication not identified]: Universitas Indonesia, 2005 |
| Program Studi : |
| Bahasa : | eng. |
| Sumber Pengatalogan : | |
| Tipe Konten : | |
| Tipe Media : | |
| Tipe Carrier : | |
| Deskripsi Fisik : | viii, 38 hlm. ; 30 cm. + Lamp. |
| Naskah Ringkas : | |
| Lembaga Pemilik : | Universitas Indonesia |
| Lokasi : | Perpustakaan UI, Lantai 3 |
| No. Panggil | No. Barkod | Ketersediaan |
|---|---|---|
| S27608 | TERSEDIA |
| Ulasan: |
| Tidak ada ulasan pada koleksi ini: 20180261 |
