Hasil Pencarian  ::  Simpan CSV :: Kembali

"Tugas akhir ini membahas tentang teori antrian dan penerapannya pada Terminal Bis Antar Kota Cililitan dengan menggunakan analisa teori antrian model Saluran Tunggal dan Ganda. Dengan analisa teori antrian model Saluran Tunggal dan Ganda, dapat diketahui apakah sistim pelayanan yang ada di Terminal Bis Antar Kota Cililitan apakah sudah melebihi kapasitasnya ( mencapal keadaan yang optimal).

---

This final project discusses the queuing theory and its application at the Cililitan Intercity Bus Terminal using the Single and Dual Channel queuing theory analysis. With the Single and Dual Channel queuing theory analysis, it can be seen whether the service system at the Cililitan Intercity Bus Terminal has exceeded its capacity (reached an optimal state)."

"Misalkan G adalah graf dengan himpunan simpul V = V(G) dan himpunan busur E = E(G), dimana |V(G)| dan |E(G)| menyatakan banyaknya simpul dan busur pada G. Suatu pemetaan dari V E ke himpunan bilangan bulat 1, 2, ..., |V|+|E| disebut pelabelan total simpul ajaib pada G jika merupakan pemetaan bijektif dengan sifat bahwa untuk setiap simpul v V, (v) + u N(v) (uv) = k dimana N(v) adalah himpunan semua simpul yang bertetangga dengan v. Nilai k disebut konstanta ajaib dari . Algoritma pelabelan sembarang graf secara umum bersifat NP-complete. Baker dan Sawada telah memberikan algoritma pelabelan total simpul ajaib pada graf lingkaran C n dan graf roda W n . Pada skripsi ini, algoritma lingkaran tersebut akan dibahas. Selain itu, akan dibangun algoritma pelabelan dan graf kecebong T m,n . total simpul ajaib pada graf matahari C n ⊙ Menggunakan algoritma-algoritma tersebut dapat dihasilkan semua pelabelan total simpul ajaib pada graf yang terkait. Algoritma-algoritma ini akan diimplementasikan menggunakan program. Sebagai hasil implementasi dilakukan simulasi yang memberikan banyaknya pelabelan total simpul ajaib yang berbeda dari graf lingkaran C n dengan 3 ≤ n ≤ 10, graf matahari C n ⊙ dengan 3 ≤ n ≤ 7, dan graf kecebong T m,n dengan 3 ≤ m ≤ 7, 1 ≤ n ≤ 5 untuk setiap nilai k yang mungkin.

---

Let graph G has vertex set V = V(G) and edge set E = E(G), and let |V(G)| and |E(G)| is the number of vertices and edges on G. A one-to-one map from V E onto {1, 2, ..., |V|+|E|} is a vertex magic total labeling if there is a constant k so that for every vertex v V, (v) + u N(v) (uv) = k where N(v) denoted the set of vertices adjacent to v. The constant k is called the magic constant of . In general, the labeling algorithms on any graphs is NP-complete. In their paper, Baker and Sawada give the vertex magic total labeling algorithms on cycle graph C n and wheel graph W n . This skripsi explains the vertex magic total labeling algorithm on cycle from Baker and Sawada and vertex magic total labeling algorithms on sun graph C n ⊙ and tadpole graph T m,n . Using these algorithms, all non-isomorphic vertex magic total labelings on those classes of graphs can obtained. These algorithms are implemented as computer programs. From simulations, we get the number of non-isomorphic vertex magic total labelings on cycles C n (3 ≤ n ≤ 10), suns C n ⊙ (3 ≤ n ≤ 7), and tadpoles T m,n (3 ≤ m ≤ 7, 1 ≤ n ≤ 5) for every possible value of k."

"Suatu graf dikatakan suatu graf jumlah jika terdapat suatu pemetaan satu-satu yang disebut pelabelan jumlah, dari ke himpunan bilangan bulat positif sedemikian sehingga untuk jika dan hanya jika , dimana . Untuk selanjutnya disebut simpul bekerja. Graf terhubung akan membutuhkan beberapa tambahan simpul terisolasi agar memenuhi aturan pelabelan jumlah. Graf jumlah dikatakan graf jumlah eksklusif jika tidak ada simpul bekerja pada graf . Banyak simpul terisolasi minimal sehingga pelabelan jumlah memenuhi pelabelan jumlah eksklusif disebut bilangan jumlah eksklusif, dinotasikan dengan . Suatu pelabelan jumlah eksklusif pada disebut optimal jika . Pada skripsi ini akan ditunjukkan bilangan jumlah eksklusif yang optimal dari graf matahari dengan . Graf korona dengan . Graf hairycycle dengan untuk genap dan dan , dimana menyatakan banyaknya simpul daun yang terhubung pada simpul ke- pada lingkaran.

---

A Graph is called a sum graph if there exist an injective labeling called sum labeling, from to a set of positive integers such that if and only if where . A vertex is called a working vertex. Any connected graph will require some additional isolated vertices in order to be sum labeled. Sum graph is said to be exclusive sum graph if contain no working vertex. The smallest number of isolated vertices such that sum labeling is an exclusive sum labeling called exclusive sum number, denoted by In this skripsi, it will be showed optimum exclusive sum number of sun graphs which is corona graphs which is , hairycycle graphs which is for even , , and , where is a number of leaves attached to the -th cycle?s vertex."

"Suatu graf D dikatakan sebagai graf berarah jika memuat suatu himpunan berhingga dan tidak kosong dari simpul simpul yang dinotasikan sebagai V D dan suatu himpunan berhingga dari busur busur berarah pada graf D yang dinotasikan sebagai A D Graf lingkaran berarah adalah graf berarah dimana dan Suatu tali busur adalah busur berarah yang menghubungkan dua simpul tidak bertetangga pada graf lingkaran berarah Letak dan arah tali busur pada graf lingkaran berarah mempengaruhi graf lingkaran dengan dua tali busur yang terbentuk Line digraph L D dari graf berarah D adalah graf berarah yang dibentuk dari graf D dengan mengikuti suaran tertentu. Letak tali busur pada graf lingkaran berarah mempengaruhi bentuk line digraph dari lingkaran berarah. Pada tugas akhir ini akan dibahas sifat sifat line digraph subgraf lingkaran bipartit dan diameter pada graf lingkaran berarah yang memiliki dua tali busur.

---

A graph is said a directed graph if it consists of a non empty and finite set of vertices which denoted by and a finite set of arcs which is denoted by A dicycle graph is a directed graph where and A chord is an arc which connects two non adjacent vertices in the dicycle graph. The position and orientation of the chords will influence the dicycle with two chords which is constructed. Line digraph of a directed graph is a directed graph formed from with particular rule. Position of a chord in a dicycle graph will affect its line digraph In this skripsi it is discussed the properties dicycle subgraph bipartite and diameter of the line digraph of a dicycle graph with two chords."

"This book contains an exposition of several results related with direct and converse theorems in the theory of approximation by algebraic polynomials in a finite interval. In addition, some facts concerning trigonometric approximation that are necessary for motivation and comparisons are included. The selection of papers that are referenced and discussed document some trends in polynomial approximation from the 1950s to the present day."

"Fundamentals of group theory provides a comprehensive account of the basic theory of groups. Both classic and unique topics in the field are covered, such as an historical look at how Galois viewed groups, a discussion of commutator and Sylow subgroups, and a presentation of Birkhoff’s theorem. "

"[This book covers the connection between algebraic K-theory and Bökstedt, Hsiang and Madsen's topological cyclic homology and proves that the difference between the theories are ‘locally constant’. The usefulness of this theorem stems from being more accessible for calculations than K-theory, and hence a single calculation of K-theory can be used with homological calculations to obtain a host of ‘nearby’ calculations in K-theory. For instance, Quillen's calculation of the K-theory of finite fields gives rise to Hesselholt and Madsen's calculations for local fields, and Voevodsky's calculations for the integers give insight into the diffeomorphisms of manifolds. In addition to the proof of the full integral version of the local correspondence between K-theory and topological cyclic homology, the book provides an introduction to the necessary background in algebraic K-theory and highly structured homotopy theory; collecting all necessary tools into one common framework. It relies on simplicial techniques, and contains an appendix summarizing the methods widely used in the field. , This book covers the connection between algebraic K-theory and Bökstedt, Hsiang and Madsen's topological cyclic homology and proves that the difference between the theories are ‘locally constant’. The usefulness of this theorem stems from being more accessible for calculations than K-theory, and hence a single calculation of K-theory can be used with homological calculations to obtain a host of ‘nearby’ calculations in K-theory. For instance, Quillen's calculation of the K-theory of finite fields gives rise to Hesselholt and Madsen's calculations for local fields, and Voevodsky's calculations for the integers give insight into the diffeomorphisms of manifolds. In addition to the proof of the full integral version of the local correspondence between K-theory and topological cyclic homology, the book provides an introduction to the necessary background in algebraic K-theory and highly structured homotopy theory; collecting all necessary tools into one common framework. It relies on simplicial techniques, and contains an appendix summarizing the methods widely used in the field. ]"

"The text that comprises this volume is a collection of surveys and original works from experts in the fields of algebraic number theory, analytic number theory, harmonic analysis, and hyperbolic geometry. A portion of the collected contributions have been developed from lectures given at the "International Conference on the Occasion of the 60th Birthday of S. J. Patterson", held at the University Göttingen, July 27-29 2009. Many of the included chapters have been contributed by invited participants."