Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Dettlaff Magda"'
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 38, Iss 2, Pp 573-586 (2018)
A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subg
Externí odkaz:
https://doaj.org/article/751c3d95a8de4ad58f8a588626989074
Let $G$ be a graph and c a proper k-coloring of G, i.e. any two adjacent vertices u and v have different colors c(u) and c(v). A proper k-coloring is a b-coloring if there exists a vertex in every color class that contains all the colors in its close
Externí odkaz:
http://arxiv.org/abs/2311.13283
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 3, Pp 661-668 (2016)
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 (
Externí odkaz:
https://doaj.org/article/947f16d6c02d44ada2548deb3d324374
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 2, Pp 315-327 (2015)
The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total do
Externí odkaz:
https://doaj.org/article/c64f2c88c221481fbdce12e03ddcc80d
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:
Dettlaff, Magda a, ⁎, Furmańczyk, Hanna a, Peterin, Iztok b, c, Roux, Adriana d, Ziemann, Radosław a
Publikováno v:
In Applied Mathematics and Computation 15 November 2024 481
A subset $D$ of $V$ is \emph{dominating} in $G$ if every vertex of $V-D$ has at least one neighbour in $D;$ let $\gamma(G)$ be the minimum cardinality among all dominating sets in $G.$ A graph $G$ is $\gamma$-$q$-{\it critical} if the smallest subset
Externí odkaz:
http://arxiv.org/abs/2002.05389
Publikováno v:
In Discrete Applied Mathematics 15 January 2024 342:253-259