Sei sulla pagina 1di 4

References

[1] B. D. Achárya, The strong domination number of a graph and re-


lated concepts, Jour. Math. Phy. Sci. 14 (5) (1980).

[2] S. B. Akers, D. Harel and B. Krishnamurthy, The star graph: An


attractive alternative to the n-cube, Proc. Intl. Conf. on Parallel

Processing (1987), 393-400.

[3] S. B. Akers and B. Krishnamurthy, A group theoretic model for


symmetric interconnection networks, Proc. Intl. Conf. on Parallel

Processing (1986), 216-223.

[41 S. Arumugam and J. Paulraj Joseph, Uniform domination in graphs,

International Journal of Management and Systems 11 (1) (1995)7


111-116.

Inter-
[5] S. Arumugam and J. Paulraj Joseph, Domination in graphs,
national Journal of Management and Systems 11 (2) (1995), 177-

182.

[6] S. Arumugam and R. Kala, Domination parameters of star graph,

Ars Combinatoria 44 (1996), 93-96.

[7] S. Arumugam and R. Kala, Domination parameters of hypercubes,


Journal of the Indian Math. Soc. (To appear).

North Holland, Amsterdam


[8] C. Berge, Graphs and Hypergraphs,
(1973).
108

[9] J. C. Bermond, Hamiltonian graphs, in Selected Topics in Graph

Theory, Eds. L. W. Beineke and R. J. Wilson, Academic Press,

London (1978), 127-167.

[10] E. J. Cockayne, R. M. Dawes and S. T. Hedetniemi, Total domina-

tion in graphs, Networks 10 (1980), 211-219.

[ii] E. J. Cockayne, B. L. Hartnell, S. T. Hedetniemi and R. Laskar,

Perfect domination in graphs, J. Comb. Inf. Syst. Sci. 18 (1993),

136-148.

[12] E. J. Cockayne and S. T. Hedetniemi, Disjoint independent domi-

nating sets in graphs, Discrete Math. 15 (1976), 213-222.

[13] E. J. Cockayne and S. T. Hedetniemi, Towards a theory of domina-


tion in graphs, Network 7 (1977), 247-261.

[14] Khaled Day and Anand Tripathi, A Comparative Study of Topolog-

ical Properties of Hypercubes and Star Graphs, Technical Report,

University of Minnesota, TR 91-10 (1991).

[15] F. Harary, Graph Theory, Addison Wesley, Reading, Mass. (1972).

[16] F. Harary and Teresa W. Haynes, Double domination in graphs,

Preprint.

[17] F. Harary and Teresa W. Haynes, The double domatic number of a


graph, Preprint.
ItST]

[18] F. Jaegar and C. Payan, Relations du type Nordlaaus-Gaddum pour


de nombre d' absorption d' un graphe simple, C-R. Acad. Sci. Paris

274 (1972) 728-730.

[19] P.. K. Jha, Hypercubes, Median Graphs and Products of Graphs:


Some Algorithmic and Combinatorial Results, Ph. D. dissertation,

Department of Computer Science, Iowa State University (1990).

[20] R. Laskar and S. T. Hedetniemi, Connected domination in graphs,


Graph theory and Combinatorics, Ed. B. Bollobas, Academic Press,
London (1984), 209-218.

[21] R. Laskar and K. Peters, Connected Domination of Complementary


Graphs, Tech. Report 429, Department of Mathematical Sciences,
Clemson University (1983).

[22] R. Laskar and H. B. Walikar, On domination related concepts in


graph theory, Proceedings of the international symposium, Indian

Statistical Institute, Calcutta, 1980, Lecture notes in Mathematics,

No. 885, Springer-verlag, Berlin (1981), 308-320.

[23] 0. Ore, Theory of Graphs, Amer. Math. Soc. Colloq. Pubi., 38,
Providence (1962).

[24] K. R. Parthasarathy, Basic Graph Theory, Tata McGraw-Hill


(1994).

[25] M. D. Plummer, Some covering concepts in graphs, Journal of Com-


binatorial Theory 8 (1970), 91-98.
110

[26] Douglas F. Rail, Dominating a graph and its complement, Cong.

Numer. 80 (1991), 89-95.

[27] G. Ravindra, Well-covered graphs, J. Comb. Inf. Syst. Sci. 2 (1)


(1977),20-21.

[28] E. Sampathkumar, A generalization of Menger's theorem for trees,


J. Comb. Inf. Syst. Sci. 8 (1) (1983), 79-80.

[29] E. Sampathkumar, The global domination number of a graph,


Jour.

Math. Phy. Sci. 23 (5) (1989).

[30] E. Sampathkumar, A generalization of Menger's theorem for certain


unicyclic graphs, Graphs and Combinatorics 8 (1992), 377-380.

[31] E. Sampathkumar and H. B. Walikar, The connected domination


number of a graph, J. Math. Phy. Sci. 13 (6) (1979), 607-613.

[32] H. B. Walikar, B. D. Acharya and E. Sampathkumar, Recent de-


velopments in the theory of domination in graphs, M.R.I. Lecture

notes in Math. 1, Mehta Research Institute, Allahabad (1979).

[33] B. Zelinka, Domatic numbers of cube graphs,


Math. Slovaca 32 (2)

(1982),117-119.

Graph
[34] B. Zelinka, Domatic number and bichromaticity of a graph, in
Theory, Lecture Notes in Mathematics, Vol. 1018, Lagow 1981,
Springer, Berlin (1983), 278-285.

Potrebbero piacerti anche