[PDF] Top 20 VERTEX (IA,D/I)-ANTIMAGIC TOTAL LABELING ON CIRCULANT GRAPH CSUBN/SUB(1,2,3) | Sugeng | Journal of the Indonesian Mathematical Society 21 369 1 PB

... pelabelan total antimagic (a, d)-titik adalah suatu bijeksi α dari semua titik- titik dan sisi-sisi ke himpunan dari bilangan bulat berurutan {1, 2, ...pelabelan total ... Lihat dokumen lengkap

... a graph with order |G| and size |E|. An (a, d)-vertex- antimagic total labeling is a bijection α from all vertices and edges to the set of consecutive integers ... Lihat dokumen lengkap

... details on the mathematical aspects of the theory of graph energy see the reviews[10], paper [11] and the references cited there ...in. The basic ... Lihat dokumen lengkap

... adopt the definition of prime ideal to the module theory ...easier. The further study of the fully prime submodules started in paper Wijayanti ...[9]. The aim of ... Lihat dokumen lengkap

... Proof. The proof is similar to the theorem 5.4 of [12] Acknowledgments:The authors thank the referees for their helpful comments and suggestions, which have improved the presentation ... Lihat dokumen lengkap

... magic labeling to be a total labeling in which the labels are the integers from 1 to |V (G)| + ...|E(G)|. The sum of labels on an edge and its two endpoints ... Lihat dokumen lengkap

... “Equivalence of weak convergence and endograph metric convergence for fuzzy number spaces”, Fuzzy logic, soft computing and computational intelligence, 11th international Fuzzy Systems Association World Congress, ... Lihat dokumen lengkap

... set of graph elements — the set of vertices, for example, or the set of all vertices and edges — and whose range is a set of positive ...if the labels associated ... Lihat dokumen lengkap

... R(G), the right regular representation of G, is a normal subgroup of the full automorphism group Aut(Γ) of ...determine the normality of Cayley digraphs of valency ... Lihat dokumen lengkap

... In the first theorem we determine all non-normal connected Cayley digraphs of valency 2 on the groups of order pq, where p and q are prime ...groups of order pq (p < q) ... Lihat dokumen lengkap

... 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a graceful ...trees of order up to 35 are ...labelings of certain known classes of graceful graphs, including paths, ... Lihat dokumen lengkap

... I W. Sudarsana: Combinatorial Mathematics Research Division, Faculty of Mathe- matics and Natural Sciences, Institut Teknologi Bandung (ITB), Jalan Ganesha No. 10 Bandung 40132, Indonesia dan Jurusan ... Lihat dokumen lengkap

... arrival of passengers at a train station and model this situation as a re- newal ...that the inter-arrival times between consecutive passengers are assumed to be independent and identically distributed ... Lihat dokumen lengkap

... In this pa-per we define three types of hypa-persufaces, which were called a hypa-perplane of the 1st kind, hyperplane of the 2nd kind and hyperplane of the 3rd kind under considerati[r] ... Lihat dokumen lengkap

... tensor of Finsler metric. The author ...transformations. The authors ...paper on infinitesimal h-conformal motions of Finsler ... Lihat dokumen lengkap

... 6= d/c and kx, (d − αc)yk < kx, bk = kx, ...to the space of dimension d ≥ ...satisfies the above condition. Our next observation shows that the new definition is still ... Lihat dokumen lengkap

... for vertex exponents of two-colored digraphs is ...with the lower bound of vertex exponent especially for primitive two-colored digraphs consisting of two ...that the ... Lihat dokumen lengkap

... 1966. The Kotzig-Ringel graceful tree conjecture states that every tree has a graceful ...trees of order up to 35 are ...labelings of certain known classes of graceful graphs, including paths, ... Lihat dokumen lengkap

... When I first heard of the idea of a dynamic survey (that is, an electronic paper that is occasionally updated without undergoing further review by referees and available free on ... Lihat dokumen lengkap

... a graph G = (V, E), we mean a finite undirected graph without loops or multiple ...edges. The order and size of G are denoted by n and m ...connected graph G, the detour distance ... Lihat dokumen lengkap