Wyniki wyszukiwania:

One of the newest problem in the eld of planar graphs is to nd a connected subgraph of a plane graph such that all the faces of that plane graph are covered. The faces of a plane graph are the maximal regions of the plane that contain no point used in the embedding. A face is said to be covered or spanned if at least one of the vertices of that face boundary is visited. We denote this type of subgraph as a face spanning subgraph. The minimum face spanning subgraph is the face spanning subgraph with minimum cost. Cost can be measured by number vertices or total weight of the edges. These kind...

The research was conducted in Protapnagar union of Assasuni upazila under Satkhira district to investigate farmers livelihood vulnerabilities pertaining to climate change. The present research is highly related with a public interview to capture the data directly from the field related with random data sampling based information. The farmers within the study region were earnestly affected by various types of hazards like, river bank erosion, salinity effects, effects of tidal flood, overweening rainfall, monsoonal cyclone, water logging as well. Agriculture is the main source of economy of...