Independent Domination Of Subcubic Graphs

Let G be a simple graph. The independent domination number i(G) is the minimum cardinality among all maximal independent sets of G. A graph is subcubic whenever the maximum degree is at most three. In this paper, we will show that the independent domination number of a connected subcubic graph of order n having minimum degree at least two is at most 3(n+1)/7, providing a sharp upper bound for subcubic connected graphs with minimum degree at least two

Participatory Statistics to Measure Prevalence in Bonded Labour Hotspots in Uttar Pradesh and Bihar: Findings of the Base- and EndLine Study

This report documents the findings of the Institute of Development Studies’(IDS) and its partner, Praxis Institute for Participatory Practices’, programme of research, learning and evaluation of the Freedom Fund funded operational work in a ‘modern slavery hotspot’ in northern India to reduce the prevalence of bonded labour in the states of Uttar Pradesh and Bihar. Research was undertaken in this programme between 2014 and 2018 by IDS and Praxis Institute teams in both states.Freedom Fun