Funder
Science and Engineering Research Board
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Geometry and Topology,Algebra and Number Theory,Analysis
Reference19 articles.
1. Bertossi, A.A. 1984. Dominating sets for split and bipartite graphs. Information Processing Letters 19 (1): 37–40.
2. Cormen, T.H., C.E. Leiserson, R.L. Rivest, and C. Stein. 2009. Introduction to algorithms. Cambridge: MIT Press.
3. Cygan, M., F.V. Fomin, Ł Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh. 2015. Parameterized algorithms. Cham: Springer.
4. Cyman, J. 2010. Total outer-connected domination in trees. Discussiones Mathematicae Graph Theory 30 (3): 377–83.
5. Cyman, J. 2007. The outer-connected domination number of a graph. Australasian Journal of Combinatorics 38: 35–46.