Equitably strong nonsplit equitable domination in graphs

• Nataraj, P. ^[1] ; Sundareswaran, R. ^[2] ; Swaminathan, V. ^[3]
  1. [1] The Madura College.
  2. [2] Sri Sivasubramaniya Nadar College of Engineering.
  3. [3] Saraswathi Narayanan College.

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 40, Nº. 4, 2021, págs. 989-999
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • In a simple, finite and undirected graph G with vertex set V and edge set E, Prof. Sampathkumar defined degree equitability among vertices of G. Two vertices u and v are said to be degree equitable if |deg(u) − deg(v)| ≤ 1. Equitable domination has been defined and studied in [7]. V.R.Kulli and B.Janakiram defined strong non - split domination in a graph [12]. In this paper, the equitable version of this new type of domination is studied