DOMINATION PARAMETERS OF POWER OF CENTIPEDE AND PN + KM

Article Sidebar

PDF
Published: Apr 13, 2018

Main Article Content

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

Downloads

Download data is not yet available.

Article Details

How to Cite
Prasad, G. E. (2018). DOMINATION PARAMETERS OF POWER OF CENTIPEDE AND PN + KM. Journal of Global Research in Mathematical Archives(JGRMA), 5(4), 28–36. Retrieved from https://jgrma.com/index.php/jgrma/article/view/452
Issue
Vol. 5 No. 4 (2018): April-2018
Section
Research Paper

Open Access: This is an open-access journal. All articles published in the Journal of Global Research in Mathematical Archives(JGRMA) are made immediately and permanently available under the Creative Commons Attribution 4.0 International (CC BY 4.0) License. Authors retain the copyright of their work and grant Journal of Global Research in Mathematical Archives(JGRMA)  the right of first publication. This license permits unrestricted use, distribution, adaptation, and reproduction in any medium or format, including commercial use, provided the original author(s), source, and license are properly acknowledged.

Google Scholar Indexed | DOI Enabled | OAI-PMH Compliant | Open Access Journal

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