Zobrazeno 1 - 10
of 1 328
pro vyhledávání: '"Henning Michael A."'
Autor:
Haynes Teresa W., Henning Michael A.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 1, Pp 35-53 (2023)
Let G be a graph with vertex set V. A subset S ⊆ V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset are at most distanc
Externí odkaz:
https://doaj.org/article/91ae7f491f714726ac790cc9d7c060e6
Autor:
Henning Michael A.
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 665-708 (2022)
In this paper we present a brief survey of bounds on selected domination parameters. We focus primarily on bounds on domination parameters in terms of the order and minimum degree of the graph. We present a list of open problems and conjectures that
Externí odkaz:
https://doaj.org/article/b31bd73096114aaa87f3b17404b17d30
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 2, Pp 613-626 (2022)
A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to some vertex in S. The domination number, γ(G), of G is the minimum cardinality of a dominating set of G. The authors proved in [A new lower bound on th
Externí odkaz:
https://doaj.org/article/219eb4d1d16441a7beb82e20e13ec770
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 1, Pp 231-248 (2022)
A set D of vertices in a graph G is a dominating set of G if every vertex outside D is adjacent in G to some vertex in D. A set D of vertices in G is a semitotal dominating set of G if D is a dominating set of G and every vertex in D is within distan
Externí odkaz:
https://doaj.org/article/4c39976312d845d79b1544eaf5f6a325
The balance game is played on a graph $G$ by two players, Admirable (A) and Impish (I), who take turns selecting unlabeled vertices of $G$. Admirable labels the selected vertices by $0$ and Impish by $1$, and the resulting label on any edge is the su
Externí odkaz:
http://arxiv.org/abs/2409.01796
Autor:
Henning Michael A., Topp Jerzy
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 3, Pp 827-847 (2021)
A subset D ⊆ VG is a dominating set of G if every vertex in VG – D has a neighbor in D, while D is a paired-dominating set of G if D is a dominating set and the subgraph induced by D contains a perfect matching. A graph G is a DPDP -graph if it h
Externí odkaz:
https://doaj.org/article/2863f0bd427643679140db0d55e1eb83
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 3, Pp 749-762 (2021)
We introduce a new setting for dealing with the problem of the domination number of the Cartesian product of graphs related to Vizing’s conjecture. The new framework unifies two different approaches to the conjecture. The most common approach restr
Externí odkaz:
https://doaj.org/article/d39ef649a90b4e12858219b3cbc08358
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 633-645 (2021)
A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S. The restrained domination number
Externí odkaz:
https://doaj.org/article/d995801dbe824214ba2206aed1735822
An identifying open code of a graph $G$ is a set $S$ of vertices that is both a separating open code (that is, $N_G(u) \cap S \ne N_G(v) \cap S$ for all distinct vertices $u$ and $v$ in $G$) and a total dominating set (that is, $N(v) \cap S \ne \empt
Externí odkaz:
http://arxiv.org/abs/2407.09692
In network theory, the domination parameter is vital in investigating several structural features of the networks, including connectedness, their tendency to form clusters, compactness, and symmetry. In this context, various domination parameters hav
Externí odkaz:
http://arxiv.org/abs/2407.01935