Geodesic
Graphs with convex domination number close to their order
Discussiones Mathematicae. Graph Theory, Tome 26 (2006) no. 2, pp. 307-316 Cet article a éte moissonné depuis la source Library of Science

Voir la notice de l'article

For a connected graph G = (V,E), a set D ⊆ V(G) is a dominating set of G if every vertex in V(G)-D has at least one neighbour in D. The distance d_G(u,v) between two vertices u and v is the length of a shortest (u-v) path in G. An (u-v) path of length d_G(u,v) is called an (u-v)-geodesic. A set X ⊆ V(G) is convex in G if vertices from all (a-b)-geodesics belong to X for any two vertices a,b ∈ X. A set X is a convex dominating set if it is convex and dominating. The convex domination number γ_con(G) of a graph G is the minimum cardinality of a convex dominating set in G. Graphs with the convex domination number close to their order are studied. The convex domination number of a Cartesian product of graphs is also considered.
Keywords: convex domination, Cartesian product 
@article{DMGT_2006_26_2_a11,
     author = {Cyman, Joanna and Lema\'nska, Magdalena and Raczek, Joanna},
     title = {Graphs with convex domination number close to their order},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {307--316},
     year = {2006},
     volume = {26},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2006_26_2_a11/}
}
TY  - JOUR
AU  - Cyman, Joanna
AU  - Lemańska, Magdalena
AU  - Raczek, Joanna
TI  - Graphs with convex domination number close to their order
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2006
SP  - 307
EP  - 316
VL  - 26
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DMGT_2006_26_2_a11/
LA  - en
ID  - DMGT_2006_26_2_a11
ER  - 
%0 Journal Article
%A Cyman, Joanna
%A Lemańska, Magdalena
%A Raczek, Joanna
%T Graphs with convex domination number close to their order
%J Discussiones Mathematicae. Graph Theory
%D 2006
%P 307-316
%V 26
%N 2
%U http://geodesic.mathdoc.fr/item/DMGT_2006_26_2_a11/
%G en
%F DMGT_2006_26_2_a11
Cyman, Joanna; Lemańska, Magdalena; Raczek, Joanna. Graphs with convex domination number close to their order. Discussiones Mathematicae. Graph Theory, Tome 26 (2006) no. 2, pp. 307-316. http://geodesic.mathdoc.fr/item/DMGT_2006_26_2_a11/

[1] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of domination in graphs (Marcel Dekker, Inc., 1998).

[2] Sergio R. Canoy Jr and I.J.L. Garces, Convex sets under some graphs operations, Graphs and Combinatorics 18 (2002) 787-793, doi: 10.1007/s003730200065.