Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Lucas C. van der Merwe"'
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
Publikováno v:
Journal of Combinatorial Optimization. 30:579-595
A graph $$G$$G is diameter $$2$$2-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter-$$2$$2-critical graph $$G$$G of order $$n$$n is at most $$\lfloo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c69030c48e1a69d8f5e5658eb1a05a75
https://doi.org/10.1007/s10878-013-9651-7
https://doi.org/10.1007/s10878-013-9651-7
Autor:
Johannes H. Hattingh, Nader Jafari Rad, John V. Matthews, Marc Loizeaux, Sayyed Heidar Jafari, Lucas C. van der Merwe
Publikováno v:
Discrete Mathematics. 312:3482-3488
Let γ t ( G ) denote the total domination number of the graph G . The graph G is said to be total domination edge critical, or simply γ t ( G ) -critical, if γ t ( G + e ) < γ t ( G ) for each e ? E ( G ? ) . We show that any γ t ( G ) -critical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::224225e4a67c0da16e1975d371c9bb05
https://doi.org/10.1016/j.disc.2012.09.001
https://doi.org/10.1016/j.disc.2012.09.001
Publikováno v:
Acta Mathematica Sinica, English Series. 28:2365-2372
The induced path number ρ(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. Broere et al. proved that if G is a graph of order n, then \(\sqrt n \leqslan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::218d9a15e9fbcdcfece37d020837b137
https://doi.org/10.1007/s10114-012-0727-6
https://doi.org/10.1007/s10114-012-0727-6
Publikováno v:
Discrete Mathematics. 312:397-404
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γt(G) of G. The graph G is total domination e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e4e417e946c7c56ac39666f1399ce2a
https://doi.org/10.1016/j.disc.2011.09.032
https://doi.org/10.1016/j.disc.2011.09.032
Publikováno v:
Discrete Mathematics. 311:1142-1149
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number @c"t(G). The graph G is 3"t-critical if @c"t(G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::343ef13ee95b371ab684e04f7d6de031
https://doi.org/10.1016/j.disc.2010.07.018
https://doi.org/10.1016/j.disc.2010.07.018
Publikováno v:
Journal of Combinatorial Optimization. 24:329-338
The induced path number ?(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 graph. A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum (o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f6a20b3c42501ca45075c04e441aa3e
https://doi.org/10.1007/s10878-011-9388-0
https://doi.org/10.1007/s10878-011-9388-0
Publikováno v:
Discrete Applied Mathematics. 158:147-153
A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number @c"t(G) of G. The graph G is total domination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee1deaf35c939a33e43730fb37f3c10a
https://doi.org/10.1016/j.dam.2009.09.004
https://doi.org/10.1016/j.dam.2009.09.004
Publikováno v:
Journal of Combinatorial Optimization. 18:23-37
Let G be a graph and ${\overline {G}}$ be the complement of G. The complementary prism $G{\overline {G}}$ of G is the graph formed from the disjoint union of G and ${\overline {G}}$ by adding the edges of a perfect matching between the corresponding
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5a6fa18dc831cc262da4247007f05b1
https://doi.org/10.1007/s10878-007-9135-8
https://doi.org/10.1007/s10878-007-9135-8
Publikováno v:
Open Mathematics, Vol 12, Iss 12, Pp 1882-1889 (2014)
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the diameter. Let G be a diameter-2-critical graph of order n. Murty and Simon conjectured that the number of edges in G is at most ⌊n 2/4⌋ and that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe451524191b2f2b8c2862d17c1ad8c3
https://doi.org/10.2478/s11533-014-0449-3
https://doi.org/10.2478/s11533-014-0449-3