Browsing MIPA by Title
Now showing items 61-80 of 81
-
Structural Properties and Labeling of Graphs
(School of Information Technology and Mathematical Sciences, University of Ballarat, 2007-11-25)The complexity in building massive scale parallel processing systems has re- sulted in a growing interest in the study of interconnection networks design. Network design a®ects the performance, cost, scalability, and ... -
A Study of Multigrid Methods with Application to Convection-Diffusion Problems
(UMIST (the University of Manchester Institute of Science and Technology), U.K., 1998-04-15)The work accomplished in this dissertation is concerned with the numerical solution of linear elliptic partial differential equations in two dimensions, in particular modeling diffusion and convection-diffusion. The ... -
Super (a,d)-edge Antimagic Total Labeling of\\ Shackle ($F_6, B_2, n$) for Developing a Polyalphabetic Cryptosystem
(2016-02-18)A graph $G$ of order $p$ and size $q$ is called an $(a,d)$-edge-antimagic total if there exist a bijection $f : V(G)\cup E(G) \to \{1,2,\dots,p+q\}$ such that the edge-weights, $w(uv)=f(u)+f(v)+f(uv), uv \in E(G)$, ... -
Super (a,d)-H- Antimagic Total Coveringf on Shackle of Cycle with Cords
(2016-01-28)Graph $G$ is a simple, finite and undirected graph. A graph $G$ is called to be an $(a,d)-H$-antimagic total covering if there is a bijective fuction $\lambda: V(G) \cup E(G) \rightarrow \{1, 2,\dots ,|V (G)| + |E(G)|\}$, ... -
Super (a,d)-H-Antimagic Total Covering of Connected Semi Jahangir Graph
(2016-02-18)Let $G$ be a finite, simple and undirected graph. A graph $G$ is called to be an $(a, d)$-$H$-antimagic total covering if there exist a bijective function $f: V(G) \cup E(G) \rightarrow \{1, 2,\dots ,|V (G)| + |E(G)|\}$ ... -
Super (a,d)H-Antimagic Total Selimut pada Graf Triangular Cycle Ladder untuk Pengembangan Ciphertext
(2016-01-28)A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $\mathcal{H}$. An $(a,d)$-$\mathcal{H}$-antimagic total covering is a total labeling $\lambda$ from $V(G)\cup ... -
Super ({\it a,d})-$\mathcal{H}$ Antimagic Total Selimut pada Gabungan Graf Triangular Ladder
(2015-03-23)Pelabelan total selimut ({\it a,d})-$\mathcal{H}$ antimagic pada graf $G$ adalah sebuah pelabelan yang memetakan fungsi $f : V(G) \cup E(G) \rightarrow \{1,2,...,|V(G)|+|E(G)|\}$ sehingga semua subgraf $H'$ yang isomorfik ... -
Super Antimagicness of a Well-defined Graph
(PMIPA FKIP Universitas Jember, 2012-06-01)A graph G of order p and size q is called an (a, d)-edge- antimagic total if there exist a bijection f : V (G)U E(G) ---> {1,2,3,4,5,...., p+ q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv); uv in E(G), form ... -
Super Antimagicness of Triangular Book and Diamond Ladder Graphs
(Indoms (Indonesian Mathematics Society), Department of Mathematics Universitas Gajah Mada, Indonesia., 2013-11-06)A graph G of order p and size q is called an (a, d)-edge-antimagic total if there exists a bijection f : V (G) U E(G) ---> {1, 2, .... , p + q} such that the edge-weights, w(uv) = f(u)+f(v)+f(uv); uv in E(G), form an ... -
Super Edge Antimagic Total pada Generalisasi Shackle Graf Kipas dan Aplikasinya dalam Pengembangan Cryptosystem
(2016-01-28)A graph $G$ of order $p$ and size $q$ is called an {\it $(a,d)$-edge-antimagic total} if there exist a bijection $f : V(G)\cup E(G) \to \{1,2,\dots,p+q\}$ such that the edge-weights, $w(uv)=f(u)+f(v)+f(uv), uv \in ... -
Super Edge-antimagic Total Labeling of Disjoint Union of Triangular Ladder and Lobster Graphs
(Indoms Indonesian Mathematics Society, 2009-10-12)A graph G of order p and size q is called an (a, d)-edge-antimagic total if there exist a bijection f : V (G) U E(G) ---> {1, 2, .... , p + q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv); uv in E(G), form ... -
Super Edge-Antimagicness for a Class of Disconnected Graphs
(CIAO (Center for Informatics and Applied Optimisation), ITMS (School of Information Technology and Mathematical Science), University of Ballarat Australia., 2006-07-13)A graph G of order p and size q is called an (a,d)-edge-antimagic total if there exist a bijection f : V (G) U E(G) ---> {1, 2, ...., p + q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv); uv in E(G), form an ... -
Teori Graph, Aplikasi dan Tumbuhnya Keterampilan Berpikir Tingkat TInggi
(2015-05-26)Kurang lebih satu tahun setengah yang lalu tepatnya tanggal 1 Agustus 2013, saya diamanati jabatan fungsional tertinggi yaitu profesor oleh Menteri Pendidikan dan Kebudayaan RI dalam Matematika Diskrit bidang Combinatorics ... -
Total Vertex Irregular Labeling of Complete Bipartite Graphs
(JCMCC, 2005) -
Total Vertex Irregularity Strength of the Disjoint Union of Sun Graphs
(International Journal of Combinatorics, 2012)A vertex irregular total $k$-labeling of a graph $G$ with vertex set $V$ and edge set $E$ is an assignment of positive integer labels $\{1,2,...,k\}$ to both vertices and edges so that the weights calculated at vertices ... -
Total vertex irregularity strength of wheel related graphs
(Australasian Journal of Combinatorics, 2011)For a simple graph G with vertex set V (G) and edge set E(G), a labeling φ : V (G) ∪ E(G) → {1, 2, . . . , k} is called a vertex irregular total klabeling of G if for any two different vertices x and y, their weights wt(x) ... -
Undur-Undur Darat (Myrmeleon sp.) sebagai Obat Alternatif Diabetes Melitus
(2015-03-17)Diabetes Melitus adalah golongan penyakit kronis yang ditandai dengan peningkatan kadar gula dalam darah sebagai akibat adanya gangguan sistem metabolisme dalam tubuh, dimana organ pankreas tidak mampu memproduksi hormon ... -
Vertex-antimagic total labelings of graphs
(Discussiones Mathematicae Graph Theory, 2003)In this paper we introduce a new type of graph labeling for a graph G(V;E) called an (a; d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V| + |E| ... -
Vertex-magic total labeling of the union of suns
(Ars Combinatoria, 2012)Let $G$ be a graph with vertex set $V=V(G)$ and edge set $E=E(G)$ and let $e=\vert E(G) \vert$ and $v=\vert V(G) \vert$. A one-to-one map $\lambda$ from $V\cup E$ onto the integers $\{ 1,2, ..., v+e \}$ is called {\it ...