Total mixed domination in graphs
From MaRDI portal
Abstract: For a graph , we call a subset a total mixed dominating set of if each element of is either adjacent or incident to an element of , and the total mixed domination number of is the minimum cardinality of a total mixed dominating set of . In this paper, we initiate to study the total mixed domination number of a connected graph by giving some tight bounds in terms of some parameters such as order and total domination numbers of the graph and its line graph. Then we discuss on the relation between total mixed domination number of a graph and its diameter. Studing of this number in trees is our next work. Also we show that the total mixed domination number of a graph is equale to the total domination number of a graph which is obtained by the graph. Giving the total mixed domination numbers of some special graphs is our last work.
Recommendations
- scientific article; zbMATH DE number 1043909
- scientific article; zbMATH DE number 1109413
- Total domination in graphs
- On the mixed domination problem in graphs
- Total domination of graphs
- On the mixed minus domination in graphs
- Mixed domination in undirected path graphs and block graphs
- Domination and total domination in hypergraphs
- On simultaneous domination and mixed connectivity in graphs
- Total domination in digraphs
Cites work
This page was built for publication: Total mixed domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101468)