Research Article

The Non-Split Domination Number of a Jump Graphs

by  N. Pratap Babu Rao, Sweta N.
journal cover
Communications on Applied Electronics
Foundation of Computer Science (FCS), NY, USA
Volume 7 - Issue 13
Published: Feb 2018
Authors: N. Pratap Babu Rao, Sweta N.
10.5120/cae2018652752
PDF

N. Pratap Babu Rao, Sweta N. . The Non-Split Domination Number of a Jump Graphs. Communications on Applied Electronics. 7, 13 (Feb 2018), 27-28. DOI=10.5120/cae2018652752

                        @article{ 10.5120/cae2018652752,
                        author  = { N. Pratap Babu Rao,Sweta N. },
                        title   = { The Non-Split Domination Number of a Jump Graphs },
                        journal = { Communications on Applied Electronics },
                        year    = { 2018 },
                        volume  = { 7 },
                        number  = { 13 },
                        pages   = { 27-28 },
                        doi     = { 10.5120/cae2018652752 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2018
                        %A N. Pratap Babu Rao
                        %A Sweta N.
                        %T The Non-Split Domination Number of a Jump Graphs%T 
                        %J Communications on Applied Electronics
                        %V 7
                        %N 13
                        %P 27-28
                        %R 10.5120/cae2018652752
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

A dominating set D of a jump graph J(G) is a non split dominating set of a jump graph if the induced sub graph < E(J(G)) – D> is connected the non split domination √ns J(G) is minimum cardinality of a non-split dominating set. In this paper many bound of √ns J(G) are obtained and its exact values of some standard graphs are found. Also its relationship with other parameters are investigated.

References
  • G. Chartrand and L.Lesnaik, Graphsand Digraphs chapman and hall Madras (1996)
  • E.J. Cockayne, Domination of undirected graphs. A survey in theory and applications of GraphsLNM642 springer-verlog 1978 141-147.
  • E.J. Cockayne and S.T. Hedetniemi a Net work 7(1977)247-261.
  • 4. F. Harary Graph theory addition Wesley Reading mass (1969).
  • V.R. Kulli and B. Janakiram The non split domination number of graph Indian. J. phy.appl.Math. 31(40 441-447 (2000)
  • V. R. Kulli and B.Janakiram, The split domination number of a graph Theory Notes of New York New York Academy of Sciences (1997) XXXII 16-19.
  • E. Sampath Kumar and H.B. Walikar J.Math.Phys.Sci 13 (1979)607-613.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Graphs domination number Non split domination number

Powered by PhDFocusTM