|
[1] R.B. Allan and R.C. Laskar, On domination and independent domination numbers
of a graph, Discrete Mathematics 23 (1978) 73–76.
[2] M.H. Akhbari, R. Hasni, O. Favaron, H. Karami, and S.M. Sheikholeslami, On the
outer-connected domination in graphs, Journal of Combinatorial Optimization 26
(2013) 10–18.
[3] John Adrian Bondy and U.S.R. Murty, Graph Theory with Applications, 1977
[4] B. Bre˘sar and T.K.
˘
Sumenjak, On the 2–rainbow domination in graphs, Discrete
Applied Mathematics 155 (2007) 2394–2400.
[5] E.J. Cockayne, P.M. Dreyer Jr., S.M. Hedetniemi, and S.T. Hedetniemi, On Roman
domination in graphs, Discrete Mathematics 278 (2004) 11–22.
[6] E.J. Cockayne, R.M. Dawes, and S.T. Hedetniemi, Total domination in graphs, Net-
works 10 (1980) 211–219.
[7] J. Cyman, The outer-connected domination number of a graph, The Australasian
Journal of Combinatorics 38 (2007) 35–46.
[8] J.F. Fink and M.S. Jacobson, n-domination in graphs, Graph Theory with Applica-
tions to Algorithms and Computer Science, John Wiley and Sons, New York (1985),
282–300.
[9] H. Jiang and E. Shan, Outer-connected domination in graphs, Utilitas Mathematica
81 (2010) 265–274.
[10] J.M. Keil and D. Pradhan, Computing a minimum outer-connected dominating set
for the class of chordal graphs, Information Processing Letters 113 (2013) 552–561.
[11] Chih Yuan Lin, Jia Jie Liu, Yue Li Wang and Chiun Chieh Hsu, Dominating Sets with
Matching Outside, The 32nd Workshop on Combinatorial Mathematics and Compu-
tation Theory(2015) 71–76.
[12] Ching-Chi Lin and Cheng-Yu Hsieh, Linear-Time Algorithm for the Paired-
Domination Problem on Weighted Block Graphs, The 32nd Workshop on Combi-
natorial Mathematics and Computation Theory
[13] D.B. West, Introduction to Graph Theory.(2nd ed.), River, N.J.: Prentice-Hall, 2001.
|