نتایج جستجو برای: sustainable constructing
تعداد نتایج: 172863 فیلتر نتایج به سال:
Recent expansion of the scale of human activities poses severe threats to Earth's life-support systems. Increasingly, protected areas (PAs) are expected to serve dual goals: protect biodiversity and secure ecosystem services. We report a nationwide assessment for China, quantifying the provision of threatened species habitat and four key regulating services-water retention, soil retention, sand...
The 17 Sustainable Development Goals (SDGs) call for a comprehensive new approach to development rooted in planetary boundaries, equity, and inclusivity. The wide scope of the SDGs will necessitate unprecedented integration of siloed policy portfolios to work at international, regional, and national levels toward multiple goals and mitigate the conflicts that arise from competing resource deman...
recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. in this paper, we present a new method for constructing vertex decomposable graphs. then we use this construction to generalize the result due to cook and nagel.
The water crisis in arid and semi-arid regions is a limiting factor for human activities and sustainable agricultural development. One of the new solutions in this field is the construction of underground dams. Underground dams compared to conventional dams that store river water in open reservoirs; block the subsurface flow of water in the cross-section of the river and store it under the ...
a graceful labeling of a graph g of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of g, such that when each edge of g has assigned a weight, given by the absolute di erence of the labels of its end vertices, the set of weights is {1, 2,..., n}. if a graceful labeling f of a bipartite graph g assigns the smaller labels to one of the two stable sets of g, then f...
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید