A note on the weakly convex and convex domination numbers of a torus
暂无分享,去创建一个
The distanced"G(u,v) between two vertices u and v in a connected graph G is the length of the shortest (u,v) path in G. A (u,v) path of length d"G(u,v) is called a (u,v)-geodesic. A set [email protected]?V is called weakly convex in G if for every two vertices a,[email protected]?X, exists an (a,b)-geodesic, all of whose vertices belong to X. A set X is convex in G if for all a,[email protected]?X all vertices from every (a,b)-geodesic belong to X. The weakly convex domination number of a graph G is the minimum cardinality of a weakly convex dominating set of G, while the convex domination number of a graph G is the minimum cardinality of a convex dominating set of G. In this paper we consider weakly convex and convex domination numbers of tori.
[1] Douglas M. Van Wieren. Critical cyclic patterns related to the domination number of the torus , 2007, Discret. Math..
[2] Joanna Cyman,et al. Graphs with convex domination number close to their order , 2006, Discuss. Math. Graph Theory.
[3] Hye Kyung Kim,et al. Bondage number of the discrete torus Cn×C4 , 2005, Discret. Math..
[4] Lutz Volkmann,et al. The signed domatic number of some regular graphs , 2009, Discret. Appl. Math..