Total mixed domination in graphs

DOI10.1080/09728600.2022.2111240zbMATH Open1511.05184arXiv1810.08773OpenAlexW2896316367MaRDI QIDQ6101468FDOQ6101468

Authors: A. P. Kazemi, Farshad Kazemnejad, Somayeh Moradi 

Publication date: 1 June 2023

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Abstract: For a graph $G=(V,E)$, we call a subset $SsubseteqVcupE$ a total mixed dominating set of $G$ if each element of $VcupE$ is either adjacent or incident to an element of $S$, and the total mixed domination number $gamm{a}_{tm}(G)$ of $G$ is the minimum cardinality of a total mixed dominating set of $G$. 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.

Full work available at URL: https://arxiv.org/abs/1810.08773

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

zbMATH Keywords

total dominationtotal graphtotal mixed domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The algorithmic complexity of mixed domination in graphs
• Title not available (Why is that?)

Cited In (1)

• Mixed tree domination number

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)