Total domination number of middle graphs

Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set of G. In this paper, we study the total domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the total domination number of the middle graph of some known families of graphs explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of middle graphs.

Original languageEnglish (US)
Pages (from-to)275-288
Number of pages14
JournalElectronic Journal of Graph Theory and Applications
Volume10
Issue number1
DOIs
StatePublished - 2022
Externally publishedYes

Keywords

  • middle graph
  • Nordhaus-Gaddum-like relation
  • total domination number

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Total domination number of middle graphs'. Together they form a unique fingerprint.

Cite this