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
• DOI: 10.22199/issn.0717-6279-4497
• 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

• Referencias bibliográficas
  • K. D. Dharmalingam, “Studies in graph theorey-equitable domination and Bottleneck domination,” Ph.D. Thesis, Madurai Kamaraj University, Madurai,...
  • K. M. Dharmalingam, “A note on the equitable covering and equitable packing of a graph”, Bulletin of international mathematical virtual institute,...
  • K. M. Dharmalingam, “Equitable associate graph of a graph”, Bulletin of international mathematical virtual institute, vol. 2, pp. 109-116,...
  • ] V. R. Kulli and B. Janakiram, “The strong non-split domination number of a graph”, International journal of management and systems, vol....
  • V. R. Kulli and B. Janakiram, “The split domination number of a graph”, Graph theory notes of New York, vol. 32, pp. 16-19. [Online]. Available:...
  • W. Meyer, “Equitable coloring”, The American mathematical monthly, vol. 80, No. 8, pp. 920-922, 1973. https://doi.org/10.2307/2319405
  • V. Swaminathan and K. M. Dharmalingam, “Degree equitable domination in graphs”, Kragujevac journal of mathematics, vol. 35, no.1, pp. 191-197,...