CFP last date
01 July 2024
Call for Paper
August Edition
CAE solicits high quality original research papers for the upcoming August edition of the journal. The last date of research paper submission is 01 July 2024

Submit your paper
Know more
Reseach Article

The Non-Split Domination Number of a Jump Graphs

by N. Pratap Babu Rao, Sweta N.
Communications on Applied Electronics
Foundation of Computer Science (FCS), NY, USA
Volume 7 - Number 13
Year of Publication: 2018
Authors: N. Pratap Babu Rao, Sweta N.
10.5120/cae2018652752

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 },
issue_date = { Feb 2018 },
volume = { 7 },
number = { 13 },
month = { Feb },
year = { 2018 },
issn = { 2394-4714 },
pages = { 27-28 },
numpages = {9},
url = { https://www.caeaccess.org/archives/volume7/number13/801-2018652752/ },
doi = { 10.5120/cae2018652752 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-09-04T20:01:58.713674+05:30
%A N. Pratap Babu Rao
%A Sweta N.
%T The Non-Split Domination Number of a Jump Graphs
%J Communications on Applied Electronics
%@ 2394-4714
%V 7
%N 13
%P 27-28
%D 2018
%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
  1. G. Chartrand and L.Lesnaik, Graphsand Digraphs chapman and hall Madras (1996)
  2. E.J. Cockayne, Domination of undirected graphs. A survey in theory and applications of GraphsLNM642 springer-verlog 1978 141-147.
  3. E.J. Cockayne and S.T. Hedetniemi a Net work 7(1977)247-261.
  4. 4. F. Harary Graph theory addition Wesley Reading mass (1969).
  5. V.R. Kulli and B. Janakiram The non split domination number of graph Indian. J. phy.appl.Math. 31(40 441-447 (2000)
  6. 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.
  7. E. Sampath Kumar and H.B. Walikar J.Math.Phys.Sci 13 (1979)607-613.
Index Terms

Computer Science
Information Sciences

Keywords

Graphs domination number Non split domination number