Zobrazeno 1 - 10
of 88
pro vyhledávání: '"Topp Jerzy"'
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 39, Iss 4, Pp 829-839 (2019)
The domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T) ≤ 3 for an
Externí odkaz:
https://doaj.org/article/80698cfa76a349a9bcad8ee592e13669
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 3, Pp 615-627 (2019)
A dominating set of a graph G is a subset D ⊆ VG such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of a smallest dominating set of G, denoted by γ(G), is the domination number of G. The accurate domination nu
Externí odkaz:
https://doaj.org/article/7aa844ca50b14f0a8d61e619a40cf38c
Autor:
Henning, Michael A., Topp, Jerzy
A set $S$ of vertices in a graph $G$ is a total dominating set of $G$ if every vertex is adjacent to a vertex in $S$. The total domination number $\gamma_t(G)$ is the minimum cardinality of a total dominating set of $G$. The total domination subdivis
Externí odkaz:
http://arxiv.org/abs/2404.16186
A graph is $\alpha$-excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the $\alpha$-excellent $2$-trees.
Comment: 10 pages, 3 figures
Comment: 10 pages, 3 figures
Externí odkaz:
http://arxiv.org/abs/2210.14387
A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The common ind
Externí odkaz:
http://arxiv.org/abs/2208.07092
Autor:
Henning, Michael A., Topp, Jerzy
A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G\setminus D$ has a neighbor in $D$, while $D$ is a 2-dominating set of $G$ if every vertex belonging to $V_G\setminus D$ is joined by at least two edges with a vertex or vert
Externí odkaz:
http://arxiv.org/abs/2103.03053
Autor:
Henning, Michael A., Topp, Jerzy
A graph $G$ is a DTDP-graph if it has a pair $(D,T)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $T$ is a total dominating set of $G$. Such graphs were studied in a number of research papers. In this paper we study furth
Externí odkaz:
http://arxiv.org/abs/2101.06247
Publikováno v:
In Discrete Applied Mathematics 15 January 2024 342:253-259
Autor:
Henning, Michael A., Topp, Jerzy
Publikováno v:
Discussiones Mathematicae Graph Theory 41 (2021) 827-847
A subset $D\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G-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
Externí odkaz:
http://arxiv.org/abs/1908.04189