نتایج جستجو برای: closed helm graph
تعداد نتایج: 314669 فیلتر نتایج به سال:
For a simple graph G with vertex set V (G) and edge set E(G), a labeling φ : V (G) ∪ E(G) −→ {1, 2, . . . , k} is called a vertex irregular total klabeling of G if for any two different vertices x and y, their weights wt(x) ∗ The work was supported by the Higher Education Commission Pakistan. 148 A. AHMAD, K.M. AWAN, I. JAVAID AND SLAMIN and wt(y) are distinct. The weight wt(x) of a vertex x in...
One of the ways of reducing active power losses in the distribution networks is using the network reconfiguration for different load levels. Since the number of possible configuration of a distribution network is usually very much and then review of all of them (especially in the network of large-scale) to finding the optimal configuration is not possible simply, therefore in this paper a new a...
As a first stage in the development of a land use change detection methodology for the TAITA research project, an absolute atmospheric correction was applied to multi-temporal SPOT XS data using the proposed historical empirical line method (HELM). Based on a small verification sample, surface reflectance (Ps) was retrieved for all bands and all dates with an average RMSE better than 2%. Compar...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید