scholarly journals Penerapan Matching pada Graf untuk Pendistribusian Pupuk Bersubsidi dengan Metode Hungarian

2020 ◽  
Vol 6 (01) ◽  
pp. 47-54
Author(s):  
Eva Wahyu Listyawati ◽  
Siti Amiroch ◽  
Novita Eka Chandra
Keyword(s):  
Bipartite Graph ◽  
Perfect Matching ◽  
Maximum Amount ◽  
Retail Price ◽  
Maximum Weight ◽  
Hungarian Method ◽  
Weighted Bipartite Graph ◽  
Distribution Problems

Increasing yields, demanding each farmer to improve the quality of agriculture, which in turn is expected to increase profits. The purpose of this paper is to determine the allocation of subsidized fertilizer distribution by the distributor of PT. Anak Gresik Raya Kencana and looking for the maximum number of subsidized fertilizer needs distributed in Lamongan district each year so that there is no scarcity and HET (Highest Retail Price) does not increase by applying the hungarian method. In this case, the problem is expressed as a bipartite graph, especially a complete weighted bipartite graph that applies the concept of matching, which is a perfect matching search with maximum weight using the Hungarian method. Matching is said to be perfect if it has fulfilled all the sets of vertices X and Y. Obtained the results of the allocation of subsidized fertilizer distribution by the distributor of PT. Anak Gresik Raya Kencana is Deket sub-district requiring 1220 tons of SP-36, Glagah sub-district requires 3208 tons of Urea, Karangbinangun sub-district requires 483 tons of Organic, mantup sub-district requires 2079 tons of ZA, middle district needs 2233 tons of NPK and fertilizer distribution problems subsidized in Lamongan district can be completed with the maximum amount of subsidized fertilizer needs distributed as many as 9223 tons every year

scholarly journals Evaluation of Yield and Quality of Three Jackfruit (Artocarpus heterophyllus L.) Genotypes

2016 ◽  
Vol 14 (1) ◽  
pp. 107-111 ◽  
Author(s):  
M H Rahman ◽  
M M Alam Patwary ◽  
H Barua ◽  
S Nahar ◽  
Abu Noman Faruq Ahmmed
Keyword(s):  
Agricultural Research ◽  
Development Program ◽  
Yield Potential ◽  
Research Station ◽  
Maximum Weight ◽  
Yield And Quality ◽  
Maturity Period ◽  
Minimum Number ◽  
Overall Performance

Yield and quality performances of three jackfruit genotypes were studied at the Agricultural Research Station, Bangladesh Agricultural Research Institute, Pahartali, Chittagong during 2013-2014. Age, growth, maturity period, yield potential and also qualitative characteristics were compared among them.  Based on overall performance with respect to bearing potential, maturity period, fruit and bulb characters, the genotypes AHPah-1 have been found promising for table purpose followed by AHPah-2 and AHPah-3. Minimum days (117) to 1st harvest were observed in AHPah-1. The number of fruits per plant was exceedingly higher (73) in AHPah-1 whereas minimum number (41) was found in AHPah-2. Maximum weight (8.40 kg) per fruit was observed in AHPah-2 and minimum was in AHPah-1(3.40 kg).  The highest single fruit length (37.25cm) was found in AHPah-2 and breadth (27.00cm) was produced by AHPah-3. Maximum number of bulbs (116) was produced in AHPah-1, whereas minimum (63.00) was in AHPah-3. Maximum weight of bulbs per fruit (4.24 kg) was produced in AHPah-2. Individual bulb weight was higher (54.42g) in AHPah -2 whereas, the lowest (16.71) was in AHPah-1. Edible portion was higher (69.27%) in AHPah-1 whereas, the lowest (53.43%) was in AHPah-3. The TSS was the highest (21.00%) in AHPah-1. The highest bulb length and breadth was found in AHPah-3. Highest seeds weight (639g) was produced in AHPah-2. Individual seed weight (8.19 g) was higher in AHPah-2. Therefore, the genotypes can be included in the variety development program after comparing with the already BARI released jackfruit variety.The Agriculturists 2016; 14(1) 107-111

scholarly journals Face-Width of Pfaffian Braces and Polyhex Graphs on Surfaces

10.37236/3540 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Dong Ye ◽  
Heping Zhang
Keyword(s):  
Bipartite Graph ◽  
Polynomial Time ◽  
Perfect Matching ◽  
Cartesian Product ◽  
Perfect Matchings ◽  
Face Width ◽  
Graphs On Surfaces ◽  
Positive Genus ◽  
Pfaffian Graph

A graph $G$ with a perfect matching is Pfaffian if it admits an orientation $D$ such that every central cycle $C$ (i.e. $C$ is of even size and $G-V(C)$ has a perfect matching) has an odd number of edges oriented in either direction of the cycle. It is known that the number of perfect matchings of a Pfaffian graph can be computed in polynomial time. In this paper, we show that every embedding of a Pfaffian brace (i.e. 2-extendable bipartite graph)  on a surface with a positive genus has face-width at most 3.  Further, we study Pfaffian cubic braces and obtain a characterization of Pfaffian polyhex graphs: a polyhex graph is Pfaffian if and only if it is either non-bipartite or isomorphic to the cube, or the Heawood graph, or the Cartesian product $C_k\times K_2$ for even integers $k\ge 6$.

Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting

2013 ◽  
Vol 22 (5) ◽  
pp. 783-799 ◽  
Author(s):  
GUILLEM PERARNAU ◽  
ORIOL SERRA
Keyword(s):  
Bipartite Graph ◽  
High Probability ◽  
Perfect Matching ◽  
Complete Bipartite Graph ◽  
Bipartite Graphs ◽  
Perfect Matchings ◽  
Asymptotic Enumeration ◽  
Complete Bipartite Graphs ◽  
Edge Colourings ◽  
Square Matrix

A perfect matchingMin an edge-coloured complete bipartite graphKn,nis rainbow if no pair of edges inMhave the same colour. We obtain asymptotic enumeration results for the number of rainbow perfect matchings in terms of the maximum number of occurrences of each colour. We also consider two natural models of random edge-colourings ofKn,nand show that if the number of colours is at leastn, then there is with high probability a rainbow perfect matching. This in particular shows that almost every square matrix of ordernin which every entry appearsntimes has a Latin transversal.

scholarly journals Evaluation of nano ceramic coating on radiographic defects of thin-walled AL4-4 aluminum alloy sand casting

10.30544/212 ◽  
2016 ◽  
Vol 22 (3) ◽  
pp. 193-204
Author(s):  
Mansour Borouni ◽  
Behzad Niroumand ◽  
Mohammad Hossein Fathi
Keyword(s):  
Transfer Rate ◽  
Ceramic Coating ◽  
Maximum Amount ◽  
Sand Mold ◽  
Gravity Casting ◽  
X Ray ◽  
Ceramic Nanoparticles ◽  
Shrinkage Defects ◽  
Thin Walled

Internal defects are among the problems in gravity casting of aluminum parts. The main internal volumetric defects are gas and shrinkage defects which form during solidification of the melt and drastically reduce the quality of the produced parts. These defects adversely affect the mechanical properties of thin walled castings parts. In this study, ceramic nanoparticles coatings were applied on the sand mold and the effect of mold coatings on the reduction of defects were investigated. X-ray radiography was used to detect defects in sand molds with ceramic nanoparticles coatings. For comparison, this test was performed on molds with micro-ceramic and graffiti coatings and uncoated sand mold. The results showed that the maximum amount of gas and shrinkage defects was observed in casting parts from AL4-1 alloy in uncoated molds. On the other hand, the minimum defects were found in molds coated with ceramic nanoparticles. It seems that the reduced defects in casting parts in molds coated with ceramic nanoparticles may be due to high thermal and chemical stability and higher heat transfer rate of the coating. These results can facilitate the production of high quality aluminum alloys parts using nanotechnology.

scholarly journals Matchings and Hamilton cycles in hypergraphs

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Daniela Kühn ◽  
Deryk Osthus
Keyword(s):  
Bipartite Graph ◽  
Perfect Matching ◽  
Minimum Degree ◽  
Hamilton Cycle ◽  
Uniform Hypergraph ◽  
Hamilton Cycles ◽  
Uniform Hypergraphs ◽  
International Audience

International audience It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is at least $n/2$ contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac's theorem on Hamilton cycles for $3$-uniform hypergraphs: We say that a $3$-uniform hypergraph has a Hamilton cycle if there is a cyclic ordering of its vertices such that every pair of consecutive vertices lies in a hyperedge which consists of three consecutive vertices. We prove that for every $\varepsilon > 0$ there is an $n_0$ such that every $3$-uniform hypergraph of order $n \geq n_0$ whose minimum degree is at least $n/4+ \varepsilon n$ contains a Hamilton cycle. Our bounds on the minimum degree are essentially best possible.

Sign in / Sign up

Export Citation Format

Share Document