Tadpole domination number of graphs

Title

Tadpole domination number of graphs

Creator

Prebhath V.S.; Sangeetha V.

Description

The graph obtained by joining cycle Cm to a path Pn with a bridge is called Tadpole graph denoted by Tm,n. A subset D of V (G) is said to be a tadpole dominating set of G if D is a dominating set and the set of vertices of D spans a tadpole graph Tm,n where m ? 3, n ? 1. In this paper, we find the tadpole domination number of cartesian product of certain graphs, namely, paths, cycles and complete graphs. Also the tadpole domination number for the Mycielskian of cycles and paths is obtained. 2023 World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications, Vol-15, No. 8

Date

2023-01-01

Publisher

World Scientific

Subject

Domination; tadpole domination number; tadpole graph

Coverage

Prebhath V.S., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bengaluru, India; Sangeetha V., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bengaluru, India

Rights

Restricted Access

Relation

ISSN: 17938309

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830922501737

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85144773425&doi=10.1142%2fS1793830922501737&partnerID=40&md5=7e90ba8cab12f260bd55606241d3534c