Domination parameters of star graph

Ars Combinatoria

Volumn 44, Issue , 1996, Pages 93-96

  Arumugam, S ^a   Kala, R ^a  

^a MANONMANIAM SUNDARANAR UNIVERSITY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030460635     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. B.D. Acharya, H.B. Walikar and E. Sampathkumar, Recent developments in the theory of domination in graphs, Mehta Research Institute, Allahabad, MRI Lecture notes in Math. 1 (1979).
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.
4. Bohdan Zelinka, Domatic number and bichromaticity of a graph, Lecture Notes in Mathematics, Bold and Eckmann, Ed., Lagow (1981), 1018.
5. E.J. Cockayne, B.L. Hartnell, S.T. Hedetniemi and R. Laskar, Perfect domination in graphs, JCISS (to appear).
6. E.J. Cockayne, S.T. Hedetniemi, Towards a theory of domination in graphs, Networks 7 (1977), 247-261.
7. F. Harary, Graph Theory, Addison Wesley, Reading Mass, 1969.
8. Khaled Day and Anand Tripathi, A Comparative study of topological properties of hypercubes and star graphs. Technical report TR- 91-10, Computer Science Department, University of Minnesota (1991).