Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Johannes H. Hattingh"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 1, Pp 57-62 (2024)
AbstractGiven any two graphs F and H, the Ramsey number R(F, H) is defined as the smallest positive integer n such that every red-blue coloring of the edges of the complete graph Kn of order n, there will be a subgraph of Kn isomorphic to F whose edg
Externí odkaz:
https://doaj.org/article/70ff72cf196349f7af1be9dd991104e7
Autor:
Ernst J. Joubert, Johannes H. Hattingh
Publikováno v:
Topics in Domination in Graphs ISBN: 9783030511166
Let G = (V, E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex in V − S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1214179db33354f7de1ffac70121c940
https://doi.org/10.1007/978-3-030-51117-3_5
https://doi.org/10.1007/978-3-030-51117-3_5
Autor:
Johannes H. Hattingh, Ernst J. Joubert
Publikováno v:
Discrete Mathematics. 341:1325-1330
For bipartite graphs G 1 , G 2 , … , G k , the bipartite Ramsey number b ( G 1 , G 2 , … , G k ) is the least positive integer b so that any coloring of the edges of K b , b with k colors will result in a copy of G i in the i th color for some i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5730bd1735a04e0ffbedb1a74fb22294
https://doi.org/10.1016/j.disc.2018.02.006
https://doi.org/10.1016/j.disc.2018.02.006
Publikováno v:
Discrete Applied Mathematics. 217:506-511
We show that the total domination number of a maximal outerplanar graph G is bounded above by n + k 3 , where n is the order of G and k is the number of vertices of degree 2. For k n 3 , a better bound is given by 2 ( n - k ) 3 . For k n 3 , we impro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08ad09f55157c1165ce13cfb4079d1b4
https://doi.org/10.1016/j.dam.2016.10.020
https://doi.org/10.1016/j.dam.2016.10.020
Publikováno v:
Discrete Mathematics. 339:1180-1188
The total domination number of a graph is the minimum size of a set S such that every vertex has a neighbor in S . We show that a maximal outerplanar graph of order n ? 5 has total domination number at most 2 n / 5 , apart from two exceptions, and th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af89d7da54bf972fc88f3b35f82c34e1
https://doi.org/10.1016/j.disc.2015.11.003
https://doi.org/10.1016/j.disc.2015.11.003
Publikováno v:
Graphs and Combinatorics. 32:987-996
The induced path number $$\rho (G)$$?(G) of a graph G is defined as the minimum number of subsets into which the vertex set of G can be partitioned so that each subset induces a path. A product Nordhaus---Gaddum-type result is a bound on the product
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0219e0ee2ee33f8fcbab08975185b67
https://doi.org/10.1007/s00373-015-1629-z
https://doi.org/10.1007/s00373-015-1629-z
Autor:
Johannes H. Hattingh, Ernst J. Joubert
Publikováno v:
Journal of Combinatorial Optimization. 31:1586-1608
Let $$G=(V,E)$$G=(V,E) be a graph. A set $$S\subseteq V$$S⊆V is a restrained dominating set if every vertex in $$V-S$$V-S is adjacent to a vertex in $$S$$S and to a vertex in $$V-S$$V-S. The restrained domination number of $$G$$G, denoted $$\gamma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cef291921af888decda1ff13c8b45cfd
https://doi.org/10.1007/s10878-015-9843-4
https://doi.org/10.1007/s10878-015-9843-4
Publikováno v:
Quaestiones Mathematicae. 37:571-589
The mixed irredundant Ramsey number t(m, n) is the smallest natural number t such that if the edges of the complete graph Kt on t vertices are arbitrarily bi-coloured using the colours blue and red, then necessarily either the subgraph induced by the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab533d0015c2a1483b5b0d29307d185f
https://doi.org/10.2989/16073606.2014.894691
https://doi.org/10.2989/16073606.2014.894691
Autor:
Johannes H. Hattingh, Ernst J. Joubert
Publikováno v:
Acta Mathematica Sinica, English Series. 30:445-452
Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex in V − S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted γr(G), is the smallest cardinality of a restrai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f57357ea017d3d94e6ff1e04d90a99c
https://doi.org/10.1007/s10114-014-2492-1
https://doi.org/10.1007/s10114-014-2492-1
Autor:
Johannes H. Hattingh, Ernst J. Joubert
Publikováno v:
Graphs and Combinatorics. 30:1175-1181
For bipartite graphs G 1, G 2, . . . ,G k , the bipartite Ramsey number b(G 1, G 2, . . . , G k ) is the least positive integer b so that any colouring of the edges of K b,b with k colours will result in a copy of G i in the ith colour for some i. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59acabad77ed14ecd957602a43cfd2ea
https://doi.org/10.1007/s00373-013-1339-3
https://doi.org/10.1007/s00373-013-1339-3