Independent partial domination

• Autores: L. Philo Nithya, Joseph Varghese Kureethara
• Localización: Cubo: A Mathematical Journal, ISSN 0716-7776, ISSN-e 0719-0646, Vol. 23, Nº. 3, 2021, págs. 411-421
• Idioma: inglés
• DOI: 10.4067/S0719-06462021000300411
• Enlaces
  • Texto completo
• Resumen
  • español

    RESUMEN Para p ∈ (0, 1], un conjunto S ⊆ V se dice que p-domina o parcialmente domina un grafo . La cardinalidad mínima entre todos los conjuntos p-dominantes se llama el número de p-dominación y se denota por γp(G). Análogamente, la dominación parcial independiente (ip(G)) es introducida y estudiada independientemente y en relación con la dominación clásica. Más aún el conjunto independiente parcial y el número de independencia parcial βp(G) se definen y se presentan algunas de sus propiedades. Finalmente, se establece la cadena de dominación partial como γp(G) ≤ ip(G) ≤ βp(G) ≤ Γp(G).

  • English

    ABSTRACT For p ∈ (0, 1], a set S ⊆ V is said to p-dominate or partially dominate a graph . The minimum cardinality among all p-dominating sets is called the p-domination number and it is denoted by γp(G). Analogously, the independent partial domination (ip(G)) is introduced and studied here independently and in relation with the classical domination. Further, the partial independent set and the partial independence number βp(G) are defined and some of their properties are presented. Finally, the partial domination chain is established as γp(G) ≤ ip(G) ≤ βp(G) ≤ Γp(G).

• Referencias bibliográficas
  • Allan, R. B.,Laskar, R.. (1978). On Domination and Independent Domination Numbers of a Graph. Discrete Math.. 23. 73
  • Bazgan, C.,Brankovic, L.,Casel, K.,Fernau, H.. (2020). Domination chain: Characterisation, classical complexity, parameterised complexity...
  • Case, B. M.,Hedetniemi, S. T.,Laskar, R. C.,Lipman, D. J.. (2017). Partial domination in graphs. Congr. Numer.. 228. 85-96
  • Caro, Y.,Hansberg, A.. (2017). Partial domination-the isolation number of a graph. Filomat. 31. 3925
  • Cockayne, E. J.,Hedetniemi, S. T.,Miller, D. J.. (1978). Properties of hereditary hypergraphs and middle graphs. Canad. Math. Bull.. 21. 461
  • Das, A.. (2019). Partial domination in graphs. Iran. J. Sci. Technol. Trans. A Sci.. 43. 1713
  • Dunbar, J. E.,Hoffman, D. G.,Laskar, R. C.,Markus, L. R.. (2000). α-Domination. Discrete Math.. 211. 11-26
  • Favaron, O.,Hedetniemi, S. M.,Hedetniemi, S. T.,Rall, D. F.. (2002). On k-dependent domination. Discrete Math.. 249. 83-94
  • Favaron, O.,Kaemawichanurat, P.. (2021). Inequalities between the Kk-isolation number and the Independent Kk-isolation number of a graph....
  • Goddard, W.,Henning, M. A.. (2013). Independent domination in graphs: a survey and recent results. Discrete Math.. 313. 839
  • Haynes, T. W.,Hedetniemi, S. T.,Slater, P. J.. (1998). Fundamentals of domination in graphs. CRC Press. Boca Raton.
  • Macapodi, R. D.,Isla, R. T.. (2019). Total partial domination in graphs under some binary operations. Eur. J. Pure Appl. Math.. 12. 1643
  • Macapodi, R. D.,Isla, R. I.,Canoy, S. R.. (2019). Partial domination in the join, corona, lexicographic and cartesian products of graphs....
  • Nithya, L. P.,Kureethara, J. V.. (2020). On Some Properties of Partial Dominating Sets. AIP Conference Proceedings. 2236.
  • Nithya, L. P.,Kureethara, J. V.. Partial domination in prisms of graphs. Ital. J. Pure Appl. Math.