Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Marcin Krzywkowski"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 1, Pp 105-111 (2021)
A subset D ⊆ V(G) is called an equitable dominating set of a graph G if every vertex v ∈ V(G) \ D has a neighbor u ∈ D such that |dG(u)-dG(v)| ≤ 1. An equitable dominating set D is a degree equitable restrained double dominating set (DERD-dom
Externí odkaz:
https://doaj.org/article/22eac842e04a4fb8bcc37aa7d0601cd1
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 1, Iss Graph Theory (2017)
A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$. The $2$-domi
Externí odkaz:
https://doaj.org/article/acf9109aa9274ce1924a249232c974eb
Autor:
Marcin Krzywkowski
Publikováno v:
Opuscula Mathematica, Vol 32, Iss 2, Pp 285-296 (2012)
The topic of this paper is the hat problem in which each of \(n\) players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players
Externí odkaz:
https://doaj.org/article/ef5c9b7f1ffd44d6a4a43899e4b2be9b
Autor:
Marcin Krzywkowski
Publikováno v:
Opuscula Mathematica, Vol 32, Iss 1, Pp 153-158 (2012)
A total outer-independent dominating set of a graph \(G=(V(G),E(G))\) is a set \(D\) of vertices of \(G\) such that every vertex of \(G\) has a neighbor in \(D\), and the set \(V(G) \setminus D\) is independent. The total outer-independent domination
Externí odkaz:
https://doaj.org/article/2bc86eb5a883435bb4a1f604e8b6e258
Autor:
Marcin Krzywkowski
Publikováno v:
Annales Universitatis Paedagogicae Cracoviensis: Studia Mathematica, Vol 10, Iss 1, Pp 67-77 (2011)
The topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one playe
Externí odkaz:
https://doaj.org/article/b9283504b4db404bbf2a57f92eb3b5a4
Autor:
Marcin Krzywkowski, Stephan Wagner
Publikováno v:
Discrete Mathematics. 341:997-1009
We give a lower bound for the number of total dominating sets of a graph together with a characterization of the extremal graphs, for trees as well as arbitrary connected graphs of given order. Moreover, we obtain a sharp lower bound involving both t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97b233881734f49f5de8278f6f696f79
https://doi.org/10.1016/j.disc.2018.01.006
https://doi.org/10.1016/j.disc.2018.01.006
Autor:
Michael A. Henning, Marcin Krzywkowski
Publikováno v:
Discrete Applied Mathematics. 236:246-255
A set D of vertices in an isolate-free graph G is a total dominating set of G if every vertex is adjacent to a vertex in D . The total domination number, γ t ( G ) , of G is the minimum cardinality of a total dominating set of G . We note that γ t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5679d3ff3529cc972e92c75263e102e
https://doi.org/10.1016/j.dam.2017.07.022
https://doi.org/10.1016/j.dam.2017.07.022
Publikováno v:
Discrete Mathematics. 339:1909-1914
For a graph G = ( V , E ) , a subset D ? V ( G ) is a dominating set if every vertex of V ( G ) ? D has a neighbor in D . The domination number of G is the minimum cardinality of a dominating set of G . The domination stability, or just γ -stability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acc84b360eb5a94c69c09f2d4ffeab1a
https://doi.org/10.1016/j.disc.2015.12.026
https://doi.org/10.1016/j.disc.2015.12.026
Autor:
Marcin Krzywkowski, Doost Ali Mojdeh
Publikováno v:
Georgian Mathematical Journal. 23:399-404
A graph is bicritical if the removal of any pair of vertices decreases the domination number. We study the properties of bicritical graphs and their relation with critical graphs, and we obtain results for bicritical graphs with edge connectivity two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0440b43dfc8952eea05028ab4a94294
https://doi.org/10.1515/gmj-2016-0019
https://doi.org/10.1515/gmj-2016-0019
Publikováno v:
Proceedings - Mathematical Sciences. 126:11-20
We initiate the study of outer-2-independent domination in graphs. An outer-2-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)∖D has a neighbor in D and the maximum vertex degree of the subgraph ind
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::915a4face75390a067e0c7f40e35640f
https://doi.org/10.1007/s12044-015-0261-4
https://doi.org/10.1007/s12044-015-0261-4