Weakly convex and weakly connected independent dominations in the corona of graphs
@inproceedings{Leonida2013WeaklyCA, title={Weakly convex and weakly connected independent dominations in the corona of graphs}, author={Rene E. Leonida and S. Canoy}, year={2013} }
In this paper we constructed a connected graph with a preassigned order, weakly convex domination number, convex domination number, weakly connected independent domination number, and upper weakly connected independent domination number; characterized the weakly convex set, the weakly convex dominating set, and the weakly connected independent dominating set of the corona graph. As direct consequence, the weakly convexity number, weakly convex domination number, and the weakly connected… CONTINUE READING
11 Citations
References
SHOWING 1-6 OF 6 REFERENCES
Fundamentals of domination in graphs
- Mathematics, Computer Science
- Pure and applied mathematics
- 1998
- 3,129
- PDF
Weak Convex Domination in Graphs
- International Journal of Engineering Science, Advanced Computing and Bio-Technology, 1
- 2010
Graph Theory, Addison-Wesley Publishing company
- Inc., USA,
- 1969