Bull. Korean Math. Soc. 2019; 56(4): 1059-1075
Online first article July 9, 2019 Printed July 31, 2019
https://doi.org/10.4134/BKMS.b180891
Copyright © The Korean Mathematical Society.
Farshad Kazemnejad, Somayeh Moradi
Ilam University; Ilam University
Let $G$ be a graph with no isolated vertex. \emph{A total dominating set}, abbreviated TDS of $G$ is a subset $S$ of vertices of $G$ such that every vertex of $G$ is adjacent to a vertex in $S$. \emph{The total domination number} of $G$ is the minimum cardinality of a TDS of $G$. In this paper, we study the total domination number of central graphs. Indeed, we obtain some tight bounds for the total domination number of a central graph $C(G)$ in terms of some invariants of the graph $G$. Also we characterize the total domination number of the central graph of some families of graphs such as path graphs, cycle graphs, wheel graphs, complete graphs and complete multipartite graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of central graphs.
Keywords: total domination number, central graph, Nordhaus-Gaddum-like relation
MSC numbers: Primary 05C76; Secondary 97K30
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd