Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "efficient" wg kryterium: Wszystkie pola


Tytuł:
Concepts Arising from Strong Efficient Domination Number. Part I
Autorzy:
Meena, N.
Gayathri, A.
Powiązania:
https://bibliotekanauki.pl/articles/1030980.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
domination
strong efficient bondage number
strong efficient domination
Opis:
Let G=(V,E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v∈V(G),|N_s [v]∩S|=1.(|N_w [v]∩S|=1) , where N_s [v]={u∈V(G) ∶uv ∈E(G),deg〖u ≥degv 〗 }. (N_w [v]={u∈V(G) ∶uv ∈E(G), degv ≥degu The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient dominating set of G and is denoted by γ_se (G) (γ_we (G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient bondage number b_se (G) of a non empty graph G is the minimum cardinality among all sets of edges X⊆E such that γ_se (G-X)>γ_se (G). In this paper, the strong efficient bondage number of some path related graphs and some special graphs are studied.
Źródło:
World Scientific News; 2020, 145; 342-353
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong Efficient Co-Bondage Number of Some Graphs
Autorzy:
Meena, N.
Vignesh, M. Madhan
Powiązania:
https://bibliotekanauki.pl/articles/1030836.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
domination
strong efficient co-bondage number
strong efficient domination
Opis:
Let G = (V, E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v ∈ V(G), |N_s [v]∩ S|=1. (|N_w [v]∩ S|=1), where N_s (v) = {u ∈V(G) : uv∈ E(G), deg u ≥ deg v}. (N_w (v) = {u ∈V(G) : uv∈ E(G), deg v ≥ deg u}). The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and is denoted by γ_se(G) (γ_we(G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient co-bondage number 〖bc〗_se(G) is the maximum cardinality of all sets of edges X ⊆ E such that γ_se (G+X) γ_se(G). In this paper, the strong efficient co-bondage number of some standard graphs and some special graphs are determined.
Źródło:
World Scientific News; 2020, 145; 234-244
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient (j,k)-domination
Autorzy:
Rubalcaba, Robert
Slater, Peter
Powiązania:
https://bibliotekanauki.pl/articles/743411.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
efficient domination
multiple domination
Opis:
A dominating set S of a graph G is called efficient if |N[v]∩ S| = 1 for every vertex v ∈ V(G). That is, a dominating set S is efficient if and only if every vertex is dominated exactly once. In this paper, we investigate efficient multiple domination. There are several types of multiple domination defined in the literature: k-tuple domination, {k}-domination, and k-domination. We investigate efficient versions of the first two as well as a new type of multiple domination.
Źródło:
Discussiones Mathematicae Graph Theory; 2007, 27, 3; 409-423
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Concepts Arising from Strong Efficient Domination Number. Part – III
Autorzy:
Vignesh, M. Madhan
Meena, N.
Powiązania:
https://bibliotekanauki.pl/articles/1031631.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
domination
strong efficient co-bondage number
strong efficient domination
Opis:
Let G = (V, E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v ∈ V(G), |N_s[] ∩ S|=1. (|N_w [] ∩ S|=1), where N_s () = {u ∈V(G) : uv ∈ E(G), deg u ≥ deg v}. (N_w () = {u ∈V(G) : uv ∈ E(G), deg v ≥ deg u}). The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and is denoted by γ_se(G) (γ_we(G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient co-bondage number (G) is the maximum cardinality of all sets of edges X ⊆ E such that γ_se( + ) ≤ γ_se(G). In this paper, further results on strong efficient co-bondage number of some special graphs are determined.
Źródło:
World Scientific News; 2020, 146; 110-120
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Concepts Arising from Strong Efficient Domination Number. Part II
Autorzy:
Meena, N.
Priyanka, G. Jeba
Powiązania:
https://bibliotekanauki.pl/articles/1031591.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Domination
strong efficient domination
strong efficient non bondage number
Opis:
Let G = (V,E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v∈V(G),|N_s [v]∩S|=1.( |N_w [v]∩S|=1), where〖 N〗_s (v)={u∈V(G):uv∈E(G),degu≥degv}(N_w (v){u∈V(G),uv∈E(G),degv≥degu}. The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and denoted by γ_se (G)(γ_we (G)). The strong efficient non bondage number b_sen (G) is the maximum cardinality of all sets of edge X⊆E such that γ_se (G-X) = γ_se (G). In this paper, the strong efficient non bondage number of some corona related graphs are studied.
Źródło:
World Scientific News; 2020, 146; 22-35
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the connectivity of efficient point sets
Autorzy:
Song, Wen
Powiązania:
https://bibliotekanauki.pl/articles/1339089.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
vector optimization
efficient point sets
density
connectivity
Opis:
The connectivity of the efficient point set and of some proper efficient point sets in locally convex spaces is investigated.
Źródło:
Applicationes Mathematicae; 1998-1999, 25, 1; 121-127
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient structural forms as a result of architect and engineer collaboration
Autorzy:
Kozikowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/398452.pdf
Data publikacji:
2018
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
collaborative design
shaping forms
efficient structures
Opis:
Structure is an essential element of most architecture works, but beyond its main function to carry loads, it can also enrich and animate the architectural space. The architect, in cooperation with the engineer, may expand awareness of the architectural potential of the load-bearing system and design efficient structural forms that are based on the natural flow of forces and are simultaneously functional, unique, and aesthetic. The article shows how to design such forms and attempts to demonstrate that they can have a positive impact on the originality and beauty of an architectural object.
Źródło:
Architecturae et Artibus; 2018, 10, 2; 35-46
2080-9638
Pojawia się w:
Architecturae et Artibus
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Conventional energy efficient routing protocols in wireless sensor networks
Autorzy:
Al-Rawi, Muaayed F.
Powiązania:
https://bibliotekanauki.pl/articles/117843.pdf
Data publikacji:
2020
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
WSN
routing protocol
energy efficient
protokół routingu
energooszczędność
Opis:
Wireless sensor network is a significant piece of wireless communication. It is a gathering of an enormous number of sensor nodes that are set in remote spots. The sensors have ability to do a typical undertaking. So energy exhaustion plays a significant job in keeping up a stable network. To build the system lifetime, a different energy effective algorithm is required which expands the network lifetime and makes the network more energy productive. For the augmenting, the lifetime of the network diverse routing technique has been utilized which help in expanding the lifetime of the network. This article portrays the diverse routing protocol which helps in energy efficient routing in a wireless sensor network.
Źródło:
Applied Computer Science; 2020, 16, 3; 80-87
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Methodology for assessment of the cost effectiveness of simple energy efficient investments
Autorzy:
Szafranko, Elżbieta
Powiązania:
https://bibliotekanauki.pl/articles/2065620.pdf
Data publikacji:
2020
Wydawca:
Politechnika Częstochowska
Tematy:
cost effectiveness
energy efficient
thermal insulation
opłacalność
energooszczędność
izolacja cieplna
Opis:
The development of energy efficient buildings has been on the increase in recent years. This trend in architectural engineering reflects both the binding legal regulation and the rational approach of investors to the construction or refurbishment of buildings. When planning such an investment, it is necessary to scrutinize the underlying guidelines and the conditions in which the building will be developed, as well as its future useful life. Economic analysis of the effectiveness of investments in the building sector employs simple and discounted methods. Depending on the scope and complexity of envisaged construction work, it is possible to apply methods from both groups. However, simple methods should suffice for simple building projects, an example of which will be discussed in the article. Three variants of planned additional thermal insulation of external walls of a residential building will be presented. The results of our calculations showed that the payback period for such an investment would be too long, which is why it is recommended to combine the thermal insulation of outer walls with some broader measures so as to shorten the time needed to achieve a good return on investment ratio.
Źródło:
Budownictwo o Zoptymalizowanym Potencjale Energetycznym; 2020, 9, 2; 111--119
2299-8535
2544-963X
Pojawia się w:
Budownictwo o Zoptymalizowanym Potencjale Energetycznym
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bent beamlets - efficient tool in image coding
Autorzy:
Lisowska, Agnieszka
Powiązania:
https://bibliotekanauki.pl/articles/764455.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2004, 2, 1
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies