Total mixed domination in graphs

AbstractFor a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the minimum cardinality of a total mixed dominating s...

Full description

Bibliographic Details
Main Authors: Adel P. Kazemi, Farshad Kazemnejad, Somayeh Moradi
Format: Article
Language:English
Published: Taylor & Francis Group 2022-09-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2022.2111240