R. Jemimal Chrislight1
, Y. Therese Sunitha Mary2
Section:Research Paper, Product Type: Journal Paper
Volume-07 ,
Issue-05 , Page no. 74-76, Mar-2019
CrossRef-DOI:
https://doi.org/10.26438/ijcse/v7si5.7476
Online published on Mar 10, 2019
Copyright © R. Jemimal Chrislight, Y. Therese Sunitha Mary . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
View this paper at
Google Scholar |
DPI Digital Library
- IEEE Citation
- MLA Citation
- APA Citation
- BibTex Citation
- RIS Citation
IEEE Style Citation: R. Jemimal Chrislight, Y. Therese Sunitha Mary, “The Nonsplit Bondage Number of Graphs,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.05, pp.74-76, 2019.
MLA Style Citation: R. Jemimal Chrislight, Y. Therese Sunitha Mary "The Nonsplit Bondage Number of Graphs." International Journal of Computer Sciences and Engineering 07.05 (2019): 74-76.
APA Style Citation: R. Jemimal Chrislight, Y. Therese Sunitha Mary, (2019). The Nonsplit Bondage Number of Graphs. International Journal of Computer Sciences and Engineering, 07(05), 74-76.
BibTex Style Citation:
@article{Chrislight_2019,
author = {R. Jemimal Chrislight, Y. Therese Sunitha Mary},
title = {The Nonsplit Bondage Number of Graphs},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {07},
Issue = {05},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {74-76},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=808},
doi = {https://doi.org/10.26438/ijcse/v7i5.7476}
publisher = {IJCSE, Indore, INDIA},
}
RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.7476}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=808
TI - The Nonsplit Bondage Number of Graphs
T2 - International Journal of Computer Sciences and Engineering
AU - R. Jemimal Chrislight, Y. Therese Sunitha Mary
PY - 2019
DA - 2019/03/10
PB - IJCSE, Indore, INDIA
SP - 74-76
IS - 05
VL - 07
SN - 2347-2693
ER -
A set D of vertices in a graph G=(V,E) is a nonsplit dominating set if the induced subgraph is connected. The minimum cardinality of a nonsplit dominating set is called the nonsplit domination number of G and denoted γ_ns (G). In this paper, we define the nonsplit bondage number b_ns (G) of a graph G to be the minimum cardinality of a set E of edges for which γ_ns (G-E)> γ_ns (G). We obtain sharp bounds for b_ns (G) and obtain the exact values for some standard graphs.
Nonsplit dominating set, Nonsplit domination number, Bondage number, Nonsplit bondage number
[1] J. F. Fink, M. S. Jacobson, L. F. Kinch and J. Roberts, The Bondage number of a graph, Discrete Math. 86(1990) 47-57.
[2] F. Harary, Graph Theory, Addision-Wesley, Reading Mass. (1969).
[3] L. Hartnell, Douglas F. Rall, Bounds on the bondage number of a graph, Discrete Mathematics 128 (1994) 173-177.
[4] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Disc.Math., Marcel Dekker, Inc., New York, 1998.
[5] V. R. Kulli and B. Janakiram, The Nonsplit Domination Number of a Graph, Indian J.Pure appl. Math., 31(4):441-447, April 2000.
