Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Dirk Meierling"'
Publikováno v:
Tamkang Journal of Mathematics. 47:421-431
Let $D=(V,A)$ be a finite and simple digraph. A Roman dominating function on $D$ is a labeling $f:V (D)\rightarrow \{0, 1, 2\}$ such that every vertex with label 0 has an in-neighbor with label 2. The weight of an RDF $f$ is the value $\omega(f)=\sum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::061603565f2c721cd6d27a0034a45be9
https://doi.org/10.5556/j.tkjm.47.2016.2100
https://doi.org/10.5556/j.tkjm.47.2016.2100
Autor:
Dirk Meierling, Peter Dankelmann
Publikováno v:
Discrete Mathematics. 339:33-38
The edge-connectivity of a connected graph or hypergraph is the minimum number of edges whose removal renders the graph or hypergraph, respectively, disconnected. The edge-connectivity of a (hyper) graph cannot exceed its minimum degree. For graphs,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14ea5f2f8046902f28403ce944417fa3
https://doi.org/10.1016/j.disc.2015.07.008
https://doi.org/10.1016/j.disc.2015.07.008
Publikováno v:
Discrete Applied Mathematics. 193:180-186
The complementary prism GG of a graph G arises from the disjoint union of G and the complement G of G by adding a perfect matching joining corresponding pairs of vertices in G and G. Partially answering a question posed by Haynes etal. (2007) we prov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dca8b42952d5a4995fb6e4363534533
https://doi.org/10.1016/j.dam.2015.04.016
https://doi.org/10.1016/j.dam.2015.04.016
Autor:
Dieter Rautenbach, Lucia Draque Penso, Mitre Costa Dourado, Fábio Protti, Aline Ribeiro de Almeida, Dirk Meierling
Publikováno v:
Networks. 66:210-213
We study perfect matchings M in graphs G that have the two properties of being robust as well as recoverable; where robust means that the failure of a set F' of not too many edges of G can be compensated, and recoverable means that this compensation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4454c5b433b2eae444361eb9e36870b8
https://doi.org/10.1002/net.21624
https://doi.org/10.1002/net.21624
Publikováno v:
Journal of Graph Theory. 81:342-350
The Ramsey numbers of cycles imply that every 2-edge-colored complete graph on n vertices contains monochromatic cycles of all lengths between 4 and at least . We generalize this result to colors by showing that every k-edge-colored complete graph on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c895c8b505966196dd41315a484ac0db
https://doi.org/10.1002/jgt.21879
https://doi.org/10.1002/jgt.21879
Autor:
Dirk Meierling, Dieter Rautenbach
Publikováno v:
Graphs and Combinatorics. 31:2335-2345
For an integer $$\ell $$l at least three, we prove that every Hamiltonian $$P_\ell $$Pl-free graph $$G$$G on $$n>\ell $$n>l vertices has cycles of at least $$\frac{2}{\ell }n-1$$2ln-1 different lengths. For small values of $$\ell $$l, we can improve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a600a349ab4370525e7372af6c7b8af
https://doi.org/10.1007/s00373-014-1494-1
https://doi.org/10.1007/s00373-014-1494-1
Publikováno v:
Journal of Graph Theory. 77:251-259
For an integer i�� at least 3, we prove that if G is a graph containing no two vertex-disjoint circuits of length at least i��, then there is a set X of at most 53i��+292 vertices that intersects all circuits of length at least i��. O
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af967ffec25314a5ef99e223d125359b
https://doi.org/10.1002/jgt.21769
https://doi.org/10.1002/jgt.21769
Publikováno v:
International Journal of Computer Mathematics. 88:905-915
A subset S of vertices of a graph G is k-dominating if every vertex not in S has at least k neighbours in S. The k-domination number γk(G) is the minimum cardinality of a k-dominating set of G, and α(G) denotes the cardinality of a maximum independ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::893aa2fc81cd196d69a888aae3a06431
https://doi.org/10.1080/00207160.2010.482664
https://doi.org/10.1080/00207160.2010.482664
Publikováno v:
Aequationes mathematicae. 82:25-34
For a positive integer k, a {k}-dominating function of a graph G is a function f from the vertex set V(G) to the set {0, 1, 2, . . . , k} such that for any vertex $${v\in V(G)}$$ , the condition $${\sum_{u\in N[v]}f(u)\ge k}$$ is fulfilled, where N[v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fd05177581a16ebabc53c3a2b1601e7
https://doi.org/10.1007/s00010-010-0062-x
https://doi.org/10.1007/s00010-010-0062-x
Publikováno v:
International Journal of Computer Mathematics. 87:2915-2924
In this article, we present a method to derive inequalities involving various domination parameters in graphs. As an application, we determine several lower bounds for these domination parameters in trees in terms of the order and the number of leave
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec63b94d80e777951cb1f6af40c3249b
https://doi.org/10.1080/00207160903137167
https://doi.org/10.1080/00207160903137167