Strong Perfect Cobondage Number of Standard Graphs

Authors

  • T. S Govindalakshmi Affiliated to Manonmaniam Sundaranar University
  • N Meena Affiliated to Manonmaniam Sundaranar UniversityStrong Perfect Cobondage Number of Standard Graphs

DOI:

https://doi.org/10.23755/rm.v45i0.983

Keywords:

Strong perfect dominating set, strong perfect domination number and strong perfect cobondage number

Abstract

Let G be a simple graph. A subset S Í V(G) is called a strong (weak) perfect dominating set of G if |Ns(u) ∩ S| = 1(|Nw(u) ∩ S| = 1) for every u ∊V(G) - S where Ns(u) = {v ∊ V(G) / uv  deg v ≥ deg u} (Nw(u) = {v ∊V(G) / uv  deg v ≤ deg u}. The minimum cardinality of a strong (weak) perfect dominating set of G is called the strong (weak) perfect domination number of G and is denoted by sp(G)( wp(G)). The strong perfect cobondage number bcsp(G) of a nonempty graph G is defined to be the minimum cardinality among all subsets of edges X E(G) for which sp (G + X) sp(G). If bcsp(G) does not exist, then bcsp(G) is defined as zero. In this paper study of this parameter is initiated.

References

ChaluvarajuB., Perfect k-domination in graphs, Australasian Journal of Combinatorics, Volume 48, Pages 175 – 184, 2010

ChangelaJ.V. and Vala G.J., Perfect domination and packing of a graph, International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 12, p61-64, June 2014.

Govindalakshmi T.S. and Meena N., Strong Perfect Domination in some Subdivision Graphs, Journal of Emerging Technologies and Innovative Research, Issue2, p710-712, February 2019.

Govindalakshmi T.S. and MeenaN., Strong Perfect Domination in Graphs, International Journal of Mathematics Trends and Technology, Volume 58, Issue 3, p29-33, June 2018.

Harary F., Graph Theory, Addison-Wesley, Reading, Mass,1969

Kulli V.R. and Janakiram B., The Co bondage number of graph, Discussiones Mathematicae Graph Theory 16 (1996), 111 – 117.

Livingston M. and Stout Q.F., Perfect dominating sets. Congr.Numer.,79: 187-203,1990.

Meena N. and Madhan Vignesh M., Strong Efficient Cobondage Number of some Graphs, An International Scientific Journal WSN 145(2020) 234-244.

Madhan Vignesh M. and Meena N., Concept Arising from Strong Efficient Domination Number. Part – III, An International Scientific Journal WSN 146(2020) 110-120.

SampathkumarE. and PushpaLathaL., Strong weak domination and domination balance in a graph, Discrete Math., 161:235-242,1996.

Teresa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater (Eds), Domination in graphs: Advanced Topics, Marcel Decker, Inc., New York, 1998.

Teresa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater, Fundamentals of domination in graphs, Marcel Decker, Inc., New York 1998.

Downloads

Published

2023-01-30

Issue

Vol. 45 (2023): Special Issue: Advances in Applied and Intellectual Mathematics

Section

Volume 44-2022

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.