Independent partial domination

Title

Independent partial domination

Creator

Philo Nithya L.; Kureethara J.V.

Description

For p ? (0, 1], a set S ? V is said to p-dominate or par-tially dominate a graph G = (V, E) if|N[S]| |V | ? p. 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 re-lation with the classical domination. Further, the partial independent set and the partial independence number ?p(G) are defined and some of their properties are pre-sented. Finally, the partial domination chain is established as ?p(G) ? ip(G) ? ?p(G) ? ?p(G). L. Philo Nithya et al.

Source

Cubo, Vol-23, No. 3, pp. 411-421.

Date

2021-01-01

Publisher

Universidad de la Frontera

Subject

Domination chain; Independent partial dominating set; Partial independent set

Coverage

Philo Nithya L., Department of Mathematics, Christ University, Karnataka, Bengaluru, India; Kureethara J.V., Department of Mathematics, Christ University, Karnataka, Bengaluru, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 7167776

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.4067/S0719-06462021000300411

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85123540001&doi=10.4067%2fS0719-06462021000300411&partnerID=40&md5=aca6e4b93a8540db0d6702a22654982d