The total co-independent domination number of some graph operations
A set $D$ of vertices of a graph $G$ is a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $D$. The total dominating set $D$ is called a total co-independent dominating set if the subgraph induced by $V(G) - D$ is edgeless. The minimum cardinality among all total co-independent dominating sets of $G$ is the total co-independent domination number of $G$. In this article we study the total co-independent domination number of the join, strong, lexicographic, direct and rooted products of graphs.
Copyright (c) 2022 Abel Cabrera-Martinez, Suitberto Cabrera-Garcia, Iztok Peterin, Ismael Gonzalez Yero
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal. The Journal may retract the paper after publication if clear evidence is found that the findings are unreliable as a result of misconduct or honest error.