Temat: DOMINATION - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A Comparative Case Study on the Social Networking of the Second Year Under Graduate Mathematics Students of the M.D.T. Hindu College, Tirunelveli, Tamil Nadu, India Using Graph Theoretic Parameters
Autorzy:: Petchiammal, S.
Murugan, K.
Powiązania:: https://bibliotekanauki.pl/articles/1193041.pdf
Data publikacji:: 2016
Wydawca:: Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:: Sociometry
In-degree
out-degree
Domination
Digraphs
In-domination
Out-domination
Opis:: In this experimental case study, the social relationship of boys and girls studying second year under graduate Mathematics boys in The M.D.T Hindu College, Tirunelveli is compared using sociometry.
Źródło:: World Scientific News; 2016, 58; 1-14
2392-2192
Pojawia się w:: World Scientific News
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

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ł

Skocz do pozycji: 3.

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ł

Skocz do pozycji: 4.

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ł

Skocz do pozycji: 5.

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ł

Informacja