...

  • Home
  • Articles
    • Current Issue
    • Archives
  • Authors
    • Author Guidelines
    • Policies
    • Downloads
  • Editors
  • Reviewers
...

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 58 | Number 3 | Year 2018 | Article Id. IJMTT-V58P528 | DOI : https://doi.org/10.14445/22315373/IJMTT-V58P528

Strong Perfect Domination in Graphs


Govindalakshmi T.S.,Meena.N
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)/ deg v ≥ deg u} (Nw(u) = {v ∈ V(G)/ deg v ≤ deg u}. The minimum cardinality of a strong (weak) perfect dominating set G is called the strong (weak) perfect domination number and is denoted by 𝛾sp(G) (𝛾wp(G)). In this paper strong perfect domination number of some standard graphs and their middle graphs are determined.

Keywords
Dominating set, perfect dominating set, strong dominating set, strong perfect dominating set, strong perfect domination number.
References

[1] B. Chaluvaraju, Perfect k-domination in graphs, Australasian Journal of Combinatorics,Volume 48, Pages 175 – 184, 2010
[2] J.V.Changela and G.J.Vala, perfect domination and packing of a graph, International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 12, p61-64, June 2014.
[3] Daisy P.Salve and Enrico L.Enriquez,Global,Inverse Perfect Domination in Graphs Journal of Pure and Applied Mathematics. ISSN 0973-1763 Volume 12,Number 1.pp.1-10,2016.
[4] M.Livingston and Q.F.Stout. Perfect dominating sets. Congr.Numer.,79: 187-203,1990
[5] M.Livingston and Q.F.Stout. Perfect dominating sets. Congr.Numer.,79: 187-203,1990.
[6] E.Sampathkumar and L.PushpaLatha, Strong weak domination and domination balance in a graph, Discrete Math., 161:235-242,1996.
[7] SharadaB.Perfect Domination Excellent Trees, International J.Math. Combin.Vol.2,p76-80,2012.
[8] Teresa W.Haynes, Stephen T.Hedetniemi, Peter J.Slater(Eds), Domination in graphs: Advanced Topics, Marcel Decker, Inc., New York, 1998.
[9] Teresa W.Haynes, Stephen T.Hedetniemi, Peter J.Slater, Fundamentals of domination in graphs, Marcel Decker, Inc., New York 1998.
[10] C.Yen and R.C.T.Lee, The weighted perfect domination problem and its varients, Discrete Applied Mathematics,66, p147-160, 1996.

Citation :

Govindalakshmi T.S.,Meena.N, "Strong Perfect Domination in Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 58, no. 3, pp. 200-204, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V58P528

  • PDF
  • Abstract
  • Keywords
  • References
  • Citation
Abstract Keywords References Citation
  • Home
  • Authors Guidelines
  • Paper Submission
  • APC
  • Archives
  • Downloads
  • Open Access
  • Publication Ethics
  • Copyrights Infringement
  • Journals
  • FAQ
  • Contact Us

Follow Us

Copyright © 2025 Seventh Sense Research Group® . All Rights Reserved