Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Magda Dettlaff"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 86-97 (2020)
Imagine that we are given a set of officials and a set of civils. For each civil , there must be an official that can serve , and whenever any such is serving , there must also be another civil that observes , that is, may act as a kind of witness, t
Externí odkaz:
https://doaj.org/article/23a4627537e24cab9c8a7584757aac43
Autor:
Magda Dettlaff, Magdalena Lemańska, Mateusz Miotk, Jerzy Topp, Radosław Ziemann, Paweł Żyliński
Publikováno v:
Opuscula Mathematica, Vol 39, Iss 6, Pp 815-827 (2019)
A set \(D\) of vertices of a graph \(G=(V_G,E_G)\) is a dominating set of \(G\) if every vertex in \(V_G-D\) is adjacent to at least one vertex in \(D\). The domination number (upper domination number, respectively) of \(G\), denoted by \(\gamma(G)\)
Externí odkaz:
https://doaj.org/article/9dbdd0228ec44afda478e3a9c3211efa
Publikováno v:
Symmetry, Vol 13, Iss 8, p 1411 (2021)
The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concep
Externí odkaz:
https://doaj.org/article/9af732d735c24421a562f0febd87bd78
Publikováno v:
Journal of Combinatorial Optimization. 44:921-933
Given a graph $G=(V(G), E(G))$, the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph $G$ are denoted by $\gamma(G)$, $\gamma_{\rm pr}(G)$, and $\gamma_{t}(G)$, respectively. For a positive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d738eb0d9d073b255012dd24944da450
https://doi.org/10.1007/s10878-022-00873-y
https://doi.org/10.1007/s10878-022-00873-y
Publikováno v:
Opuscula Mathematica, Vol 36, Iss 5, Pp 575-588 (2016)
Given a graph \(G=(V,E)\), the subdivision of an edge \(e=uv\in E(G)\) means the substitution of the edge \(e\) by a vertex \(x\) and the new edges \(ux\) and \(xv\). The domination subdivision number of a graph \(G\) is the minimum number of edges o
Externí odkaz:
https://doaj.org/article/e20e4f66d36f4a8587f9eee6fd21157a
Publikováno v:
Mathematical Methods in the Applied Sciences. 45:7050-7057
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::566f2e6918da9f3a621141dd42e09e2d
https://doi.org/10.1002/mma.8223
https://doi.org/10.1002/mma.8223
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 46
A graph G is $$\alpha $$ α -excellent if every vertex of G is contained in some maximum independent set of G. In this paper, we characterize $$\alpha $$ α -excellent bipartite graphs, $$\alpha $$ α -excellent unicyclic graphs, $$\alpha $$ α -exce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad4424b337bdab9b04c767ef5e992f0a
https://doi.org/10.1007/s40840-022-01456-0
https://doi.org/10.1007/s40840-022-01456-0
Publikováno v:
Discrete Applied Mathematics. 304:153-163
Given two types of graph theoretical parameters ρ and σ , we say that a graph G is ( σ , ρ ) -perfect if σ ( H ) = ρ ( H ) for every non-trivial connected induced subgraph H of G . In this work we characterize ( γ w , τ ) -perfect graphs, (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f51cd5bfb1fc046ab17e7527e36f459
https://doi.org/10.1016/j.dam.2021.07.034
https://doi.org/10.1016/j.dam.2021.07.034
Publikováno v:
Graphs and Combinatorics. 37:691-709
A set S of vertices in a graph G is a dominating set if every vertex not in S is ad jacent to a vertex in S. If, in addition, S is an independent set, then S is an independent dominating set. The independent domination number i(G) of G is the minimum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94faccc311eebc83f1489b6a0f8b8df9
https://doi.org/10.1007/s00373-020-02269-3
https://doi.org/10.1007/s00373-020-02269-3
Publikováno v:
Journal of Combinatorial Optimization. 41:56-72
An Italian dominating function (IDF) on a graph G is a function $$f:V(G)\rightarrow \{0,1,2\}$$ f : V ( G ) → { 0 , 1 , 2 } such that for every vertex v with $$f(v)=0$$ f ( v ) = 0 , the total weight of f assigned to the neighbours of v is at least
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a915f4d78b21c3b5fd4f598dd8bcb32
https://doi.org/10.1007/s10878-020-00658-1
https://doi.org/10.1007/s10878-020-00658-1