THE BLOCK PERFECT DOMINATION NUMBER OF A GRAPH

S. R. Ramachandra (India) and N. D. Soner (India)

Received June 5, 2009

References:

[1] E. J. Cockayne, R. M. Dawes and S. T. Hedetniemi, Total domination in graphs, Networks 10(3) (1980), 211-219. [2] E. J. Cockayne, B. L. Hartnell, S. T. Hedetniemi and R. Laskar, Perfect domination in graphs, J. Combin. Inform. System Sci. 18(1-2) (1993), 136-148. [3] F. Harary, Graph Theory, Addison-Wesley Publishing Co., Reading, Mass., 1969. [4] V. R. Kulli and N. D. Soner, The connected efficient domination number of a graph, IJOMS 19(1) (2003), 37-42. [5] J. Paulraj Joseph and S. Arumugam, On connected cutfree domination in graphs, Indian J. Pure Appl. Math. 23(9) (1992), 643-647.

Keywords and phrases: graph, perfect domination number, connected cutfree perfect domination number, block perfect domination number.