MIPA: Recent submissions
Now showing items 41-60 of 81
-
Design and Implementation of Roaster Control System Using Image Processing
(Bogor Agricultural University, 2013)Indonesian coffee beans’ production significantly rises every year, but the quality of the coffee is poor especially for farmers’ home production. That’s why we need to increase the technology ... -
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 ... -
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 ... -
The Air Flow Analysis of Coffee Plantation Based on Crops Planting Pattern of the Triangular Grid and Shackle of Wheel Graphs by Using a Finite Volume Method
(InaCombS (Indonesian Combinatorials Society), Universitas Islam Malang, 2014-06-09)Coffee bean is one of the Indonesia major export commodity. Based on the data from the 2012, Indonesia was ranked at third biggest coffee beans exporter in the world, after Vietnam and Brazil. A coffee land expansion ... -
The Analysis of Air Circulation on Coffee Plantation Based on the Level of Plants Roughness and Diamond Ladder Graph Cropping Pattern Using Finite Volume Method
(InaCombS (Indonesian Combinatorials Society), Universitas Islam Malang, 2014-06-09)One of the Indonesia major export commodity is a coffee bean. The field expansion have been focused several years ago to increase the productivity, but it does not give a significant effect. One of the factors that ... -
Antimagic Total labeling of Disjoint Union of Disconnected Graph
(CSS Jember, National Library : Katalog Dalam Terbitan (KDT), 2013-04-02)A network topology (either communication network in general or a network in a computer) can be modeled as a graph or a directed graph (digraph, for short), where each processing element is represented by a vertex and ... -
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 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 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 ... -
On diregularity of digraphs of defect two
(The University of Newcastle Australia, 2007-11-05)Since Moore digraphs do not exist for k /= 1 and d /= 1, the problem of finding the existence of digraph of out-degree d >= 2 and diameter k >= 2 and order close to the Moore bound becomes an interesting problem. To ... -
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 ... -
Open Problems in the Construction of Large Directed Graphs
(Proceedings of the sixteenth Australasian Workshop on Combinatorial Algoritms, 2005-09-15)In this paper we consider the problem of how to construct directed graphs with given maximum out-degree and diameter. To deal with this problem, we describe several construction techniques. These fall into three broad ... -
Aktivitas antimalaria ekstrak metanol dan fraksi kloroform buah Duranta repens L. pada mencit yang diinfeksi Plasmodium berghei
(Lembaga Penelitian Universitas Jember, 2009-06)Malaria is one of the most prevalent infectious diseases in the tropical countries. The resistance of Plasmodium for many synthetic antmalarial drugs has encouraged the scientist to look for new drugs from the nature. ... -
MCF-7 Resistant doxorubicin are characterized by lamelapodia, strong adhesion on substrate and P-gp overexpression
(Indonesian Society of Cancer Chemoprevention, 2011)The prognosis of breast cancer patients is closely associated with the response of tumor cells to chemotherapy agent. Doxorubicin is one of the primary chemotherapeutic agents used for the treatment of breast cancer. ... -
Combination of Leunca Herb Ethanolic Extract and Doxorubicin Suppresses HeLa Cells' Growth
(Indonesian Society of Cancer Chemoprevention, 2011)Leunca (Solanum nigrum L.) ethanolic extract showed cytotoxic activity on several cancer cell lines (HepG2, HT-29) and showed anti-proliferative activity on MCF-7 cells. Its application as a combination agent in chemotherapy ... -
Pemanfaatan paralel port mikrokomputer untuk pengukuran simultan empat parameter kualitas air
(Jurnal Kimia Lingkungan; Kelompok Studi Lingkungan Indonsia, 2006) -
Kolorimetrik sampler pasif untuk gas NO2 menggunakan media kertas saring
(Kelompok Studi Lingkungan Indonsia, 2006) -
Bounds on the number of isolates in sum graph labeling
(Discrete Mathematics, 2001)A simple undirected graph H is called a sum graph if there is a labeling L of the vertices of H into distinct positive integers such that any two vertices u and v of H are adjacent if and only if there is a vertex w with ... -
Diregularity of digraphs of out-degree three and order two less than Moore bound
(Proceeding of 12th Australasian Workshop on Combinatorial Algorithms, 2001)It is easy to show that any digraph with out-degree at most $d \ge 2$, diameter $k \ge 2$ and order $n=d+d^2+\dots + d^k - 1$, that is, two less than Moore bound must have all vertices of out-degree $d$. In other words, ... -
On two conjectures concerning vertex magic total labelings of generalized Petersen graphs
(Bulletins of ICA, 2001)A vertex-magic total labeling of a graph with $v$ vertices and $e$ edges is defined as a one-to-one map taking the vertices and edges onto the integers $1,2,\dots ,v+e$ with the property that the sum of the label on a ...