Temat: perfect domination - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Bounds on perfect k-domination in trees: an algorithmic approach
Autorzy:: Chaluvaraju, B.
Vidya, K. A.
Powiązania:: https://bibliotekanauki.pl/articles/255985.pdf
Data publikacji:: 2012
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: k-domination
perfect domination
perfect k-domination
Opis:: Let k be a positive integer and G = (V, E) be a graph. A vertex subset D of a graph G is called a perfect k-dominating set of G if every vertex v of G not in D is adjacent to exactly k vertices of D. The minimum cardinality of a perfect k -dominating set of G is the perfect k-domination number γkp (G ). In this paper, a sharp bound for γkp (T) is obtained where T is a tree.
Źródło:: Opuscula Mathematica; 2012, 32, 4; 707-714
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: A New Upper Bound for the Perfect Italian Domination Number of a Tree
Autorzy:: Nazari-Moghaddam, Sakineh
Chellali, Mustapha
Powiązania:: https://bibliotekanauki.pl/articles/32304138.pdf
Data publikacji:: 2022-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: Italian domination
Roman domination
perfect Italian domination
Opis:: A perfect Italian dominating function (PIDF) on a graph $G$ is a function $ f : V (G) \rightarrow \{ 0, 1, 2 \} $ satisfying the condition that for every vertex u with $f(u) = 0$, the total weight of $f$ assigned to the neighbors of $u$ is exactly two. The weight of a PIDF is the sum of its functions values over all vertices. The perfect Italian domination number of $G$, denoted $ \gamma_I^p (G) $, is the minimum weight of a PIDF of $G$. In this paper, we show that for every tree $T$ of order $ n \ge 3 $, with $ \mathcal{l} (T) $ leaves and $s(T)$ support vertices, $ \gamma_I^p (T) \ge \tfrac {4n- \mathscr{l}(T) + 2s (T) - 1}{5} $, improving a previous bound given by T.W. Haynes and M.A. Henning in [Perfect Italian domination in trees, Discrete Appl. Math. 260 (2019) 164–177].
Źródło:: Discussiones Mathematicae Graph Theory; 2022, 42, 3; 1005-1022
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: An inequality chain of domination parameters for trees
Autorzy:: Cockayne, E.
Favaron, O.
Puech, J.
Mynhardt, C.
Powiązania:: https://bibliotekanauki.pl/articles/744211.pdf
Data publikacji:: 1998
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: domination
irredundance
packing
perfect neighbourhoods
annihilation
Opis:: We prove that the smallest cardinality of a maximal packing in any tree is at most the cardinality of an R-annihilated set. As a corollary to this result we point out that a set of parameters of trees involving packing, perfect neighbourhood, R-annihilated, irredundant and dominating sets is totally ordered. The class of trees for which all these parameters are equal is described and we give an example of a tree in which most of them are distinct.
Źródło:: Discussiones Mathematicae Graph Theory; 1998, 18, 1; 127-142
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Perfect connected-dominant graphs
Autorzy:: Zverovich, Igor
Powiązania:: https://bibliotekanauki.pl/articles/743393.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: Connected domination
perfect connected-dominant graph
Opis:: If D is a dominating set and the induced subgraph G(D) is connected, then D is a connected dominating set. The minimum size of a connected dominating set in G is called connected domination number $γ_c(G)$ of G. A graph G is called a perfect connected-dominant graph if $γ(H) = γ_c(H)$ for each connected induced subgraph H of G.We prove that a graph is a perfect connected-dominant graph if and only if it contains no induced path P₅ and induced cycle C₅.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 1; 159-162
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: Some Variations of Perfect Graphs
Autorzy:: Dettlaff, Magda
Lemańska, Magdalena
Semanišin, Gabriel
Zuazua, Rita
Powiązania:: https://bibliotekanauki.pl/articles/31340821.pdf
Data publikacji:: 2016-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: k-path vertex cover
distance k-domination number
perfect graphs
Opis:: We consider (ψ_k−γ_k−1)-perfect graphs, i.e., graphs G for which ψ_k(H) = γ_k−1(H) for any induced subgraph H of G, where ψ_k and γ_k−1 are the k-path vertex cover number and the distance (k − 1)-domination number, respectively. We study (ψ_k−γ_k−1)-perfect paths, cycles and complete graphs for k ≥ 2. Moreover, we provide a complete characterisation of (ψ₂ − γ₁)- perfect graphs describing the set of its forbidden induced subgraphs and providing the explicit characterisation of the structure of graphs belonging to this family.
Źródło:: Discussiones Mathematicae Graph Theory; 2016, 36, 3; 661-668
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 6.

Tytuł:: Some properties of the zero divisor graph of a commutative ring
Autorzy:: Nazzal, Khalida
Ghanem, Manal
Powiązania:: https://bibliotekanauki.pl/articles/729189.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: automorphism group of a graph
center of a graph
core of a graph
k-domination number
Gaussian integers modulo n
median of a graph
2-packing
perfect graph
and zero divisor graph
Opis:: Let Γ(R) be the zero divisor graph for a commutative ring with identity. The k-domination number and the 2-packing number of Γ(R), where R is an Artinian ring, are computed. k-dominating sets and 2-packing sets for the zero divisor graph of the ring of Gaussian integers modulo n, Γ(ℤₙ[i]), are constructed. The center, the median, the core, as well as the automorphism group of Γ(ℤₙ[i]) are determined. Perfect zero divisor graphs Γ(R) are investigated.
Źródło:: Discussiones Mathematicae - General Algebra and Applications; 2014, 34, 2; 167-181
1509-9415
Pojawia się w:: Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja