DOMINATION PARAMETERS OF POWER OF CENTIPEDE AND PN + KM

G. Easwara Prasad

Abstract


The domination parameters of a graph  of order  has been already introduced. It is defined as  is a dominating set of  if every vertex  is adjacent to atleast one vertex in  In this paper, we have established various domination parameters of  power of Centipede graph and Pn + Km  , also we have  studied the relation between this parameters and illustrated with an examples.

Keywords: Graph, Domination, Centipede, Path and null graph


Full Text:

PDF

References


R.B. Allan, R. C. Laskar On domination independent domination number of a graph Discrete math 23 (1978), 73 – 76.

B.D. Acharya. The strong domination number of a graph J. Math Phys .Sci. 14(5). 1980

A.A. Bertossi Total domination in interval graph Inf. Process Lelt.23 (1986), 131 – 134

M. Farher. Domination independent domination and duality in strongly chordal graph. Discret Appl. Math 7 (1984) 115 – 130

G.J. Charg and G. L. Nembanser. The k-domination and k- stability problems on

Sun-free chordel graph SHAM. I. Alg. Dissc. Math 5 (1984) 332 –n 345

Robert. B, ALLAN , Renu LASKART and Stephen HEDEINIEMIH A NOTE ON TOTAL DOMINATION DISCRETE mathematics 9 (1984) 7 – 13

T.Y. Chang and W. E. Clark. The domination numbers of the 5  n and the 6  n grid graphs. J.Graph Theory 17 (1) 81 – 107, 1993

V.R. Kulli and A . Singar kanti, Inverse domination in graphs Nat. Acad. Sci. letters 14: 473 – 475, 1991

M. Zwierx Chowski. The domination parameter of the Corona and itse generalization ARS combin. 72: 171 – 180, 2004


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC BY-SA

Free Web Counter