PL EN


Preferences help
enabled [disable] Abstract
Number of results
2020 | 146 | 110-120
Article title

Concepts Arising from Strong Efficient Domination Number. Part – III

Content
Title variants
Languages of publication
EN
Abstracts
EN
Let G = (V, E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v ∈ V(G), |N_s[𝑣] ∩ S|=1. (|N_w [𝑣] ∩ S|=1), where N_s (𝑣) = {u ∈V(G) : uv ∈ E(G), deg u ≥ deg v}. (N_w (𝑣) = {u ∈V(G) : uv ∈ E(G), deg v ≥ deg u}). The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and is denoted by γ_se(G) (γ_we(G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient co-bondage number 𝑏𝑐𝑠𝑒(G) is the maximum cardinality of all sets of edges X ⊆ E such that γ_se(𝐺 + 𝑋) ≤ γ_se(G). In this paper, further results on strong efficient co-bondage number of some special graphs are determined.
Year
Volume
146
Pages
110-120
Physical description
Contributors
  • Department of Mathematics, The M.D.T. Hindu College, Tirunelveli, Tamil Nadu, India
author
  • Department of Mathematics, The M.D.T. Hindu College, Tirunelveli, Tamil Nadu, India
References
  • [1] M. Anitha and S. Balamurugan, Strong Efficient Open Domination in Graphs. Int. J. Math. And Appl. 6(1–B) (2018), 337–342
  • [2] S. Balamurugan, M. Anitha and N. Anbazhagan, Some Results On Strong Efficient Open Domination. International Journal of Pure and Applied Mathematics Volume 119 No. 15, 2018, 641-648
  • [3] D.W. Bange, A.E. Barkauskas and P.J. Slater, Efficient dominating sets in graphs. Application of Discrete Mathematics, 189 – 199, SIAM, Philadephia, 1988.
  • [4] D.W. Bange, A.E. Barkauskas, L.H.Host and P.J. Slater, Generalized domination and efficient domination in graphs. Discrete Mathematics, 159, 1-11, 1996.
  • [5] Frank Harary, Teresa W. Haynes, Peter J. Slater, Efficient and Excess Domination in Graphs. JCMCC 26, 83-95, 1998.
  • [6] H. Gavlas and K. Schultz, Efficient Open Domination, Electron. Notes Discrete Math. 11 (2002) 681-691
  • [7] J.H. Hattingh, M.A. Henning. On strong domination in graphs. J. Combin. Math. Combin. Compute. 26, 73-82, 1998.
  • [8] R. M. Karthikeyan, R. Jahir Hussain, The Co-Bondage (Bondage) number of fuzzy graphs and its properties. Malaya Journal of Matematik, 5(3) (2017) 483-493
  • [9] V.R. Kulli, Nonbondage number of graphs and diagraphs. International Journal of Advanced Research in Computer Sci and Technology, 3(1), 55-65 (2015).
  • [10] V.R. Kulli and B. Janakiram, The Cobondage Number of a graph. Discussiones Mathematicae, Graph Theory 16 (1996) 111-117
  • [11] V.R. Kulli and B. Janakiram. The maximal domination number of a graph. Graph Theory Notes of New York, New York Academy of Sciences, 33, 11-13 (1997).
  • [12] V. R. Kulli and B. Janakiram, The total global domination number of a graph. Indian J. Pure Appl. Math. 27, 537-542 (1996).
  • [13] V.R. Kulli and D.K. Patwari, Total Efficient domination in graphs. IRJPA, 6(1) (2016), 227-232
  • [14] V.R. Kulli and N. D. Soner, Efficient bondage number of a graph. Nat. Acad. Sci. Lett. 19 (9 and 10), 197-202 (1996).
  • [15] M. Madhan Vignesh, N. Meena, Strong Efficient Co-Bondage Number of some Graphs, World Scientific News, 145 (2020) 234-244
  • [16] N. Meena, A. Subramanian, V. Swaminathan, Strong Efficient Domination and Strong Independent Saturation Number of Graphs. International Journal of Mathematics and Soft Computing, Vol. 3, no. 2, 41-48, 2013
  • [17] N. Meena, A. Subramanian and V. Swaminathan, Strong Efficient Domination in Graphs. International Journal of Innovative Science, Engineering & Technology, Vol. I Issue 4, 172-177, June 2014.
  • [18] N. Meena, Strong Efficient Edge Domination Number of Some Corona Related Graphs. Journal Emerging Technologies and Innovative Research, Vol. 6 Issue 2, 778-787, February 2019.
  • [19] N. Meena, Strong Efficient Edge Domination Number of Some Cycle Related Graphs. International Journal of Mathematical Trends and Technology, Vol. 59, Issue 3, 201-207, July 2018.
  • [20] N. Meena, Strong Efficient Domination Number of Inflated graphs of some standard graphs. International Journal of Scientific and Innovative Mathematical Research, Vol. 2, Issue 5, 435-440, May 2014.
  • [21] K. Murugan, Square Graceful Labeling of Some Graphs. International Journal of Innovative Research in Science, Engineering and Technology, Vol. 4, Issue 2, p. 511-520, February 2015.
  • [22] K. Murugan and N. Meena, Some Nordhaus-Gaddum Type Relations on strong efficient dominating sets. Journal of New Results in Science, 11, 04-16, 2016.
  • [23] N. Pratap Babu Rao, N. Sweta, Strong Efficient Domination in Jump Graphs. International Journal of Innovative Research in Science, Engineering and Technology, Vol. 7, Issue 4, April 2018, 4011-4014
  • [24] D. Rautenbach, Bounds on strong domination number. Discrete Math 215 (2000) 201-212
  • [25] E. Sampathkumar and L. Pushpalatha, Strong weak domination and domination balance in a graph. Discrete Math. 161: 235-242, 1996
  • [26] A. Senthil Thilak, Sujatha V Shet and S.S. Kamath, Changing and unchanging efficient domination in graphs with respect to edge addition. Mathematics in Engineering, Science and Aerospace Vol. 11, No 1, 201-213, 2020.
  • [27] Teschner, U, New results about the bondage number of a graph. Discret. Math. 171, 249-259, 1997.
  • [28] P. Thangaraju, Strong and weak co-bondage numbers of a graph. Journal of Information and Optimization Sciences, Vol. 39, Issue 4 (2018) 879-887
  • [29] J.M. Xu, On bondage numbers of graphs - a survey with some comments. International Journal of Combinatorics, vol. 2013, Article ID 595210, 34 pages, 2013.
  • [30] Ulrich Teschner, New results about the bondage number of a graph. Discrete Mathematics, Volume 171, 249-259, 1994.
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-17ed6920-ac73-4c8a-baf3-42a9e85faac5
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.