Nisa Erma Fitriana
Unknown Affiliation

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

PENGARUH KEBIJAKAN DANA DESA TERHADAP JUMLAH PENDUDUK MISKIS PEDESAAN DI INDNESIA Nisa Erma Fitriana; Riatu Mariatul Qibthiyyah
Jurnal Ekonomi dan Kebijakan Publik Indonesia Vol 8, No 1 (2021): MEI 2021
Publisher : Syiah Kuala University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24815/ekapi.v8i1.21120

Abstract

AbstractIn 2014, the Indonesian government issued Law No. 6 of 2014 concerning Villages, a form of state recognition of villages, specifically in clarifying village authority and functions and strengthening the position of towns and village communities as development targets. One of the objectives of this Village Fund policy is to reduce the rural poverty level in Indonesia. This policy first appeared in the Jokowi-JK era as the central government’s effort in poverty alleviation programs and reducing inequality between rural and urban poverty. In the last nine years, rural poverty has always been higher than urban poverty. This study uses panel data from 514 districts/cities in Indonesia from 2010 to 2018. The results show that in 2015-2018, the Village Fund Policy impacted rural poverty levels using the fixed-effect estimation method. In terms of magnitude, it may signal the inefficiency of the policy. On the other hand, in contrast to Village Fund (DD – Dana Desa), another source of village revenues such as Financial Assistance (BK – Bantuan Keuangan), the transfer fund from district/city governments and provincial government, have a more significant effect on rural poverty.
PELABELAN CORDIAL UNTUK GRAF SPLIT DARI BEBERAPA GRAF Nisa Erma Fitriana; Lucia Ratnasari
Jurnal Matematika Vol 1, No 1 (2012): jurnal matematika
Publisher : MATEMATIKA FSM, UNDIP

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Cordial labeling is a binary point labeling that have absolute value condition of the difference in the number of vertices having label 0 and the number of vertices having label 1 is less than or equal to 1 dan absolute value of the difference in  the number of edges having label 0 and the number of edges having label 1 is less than or equal to 1. Graph which qualified of cordial labeling is called cordial graph. Split graph S(G) is the graph obtained by taking a new vertex v’ for each vertex v of a graph G , a new vertex v’ is connected to all vertices of G which adjacent to v . In this final paper explored about cordial labeling for split graph of path graph, cycle graph, wheel graph, matching graph, fan graph, bipartite complete graph, and k copies star graph