Total outer-connected domination number of middle graphs
Combinatorics
2023-08-07 v1
Abstract
In this paper, we study the total outer-connected domination number of the middle graph of a simple graph and we obtain tight bounds for this number in terms of the order of the middle graph. We also compute the total outer-connected domination number of some families of graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total outer-connected domination number of middle graphs.
Cite
@article{arxiv.2308.02127,
title = {Total outer-connected domination number of middle graphs},
author = {Farshad Kazemnejad and Behnaz Pahlavsay and Elisa Palezzato and Michele Torielli},
journal= {arXiv preprint arXiv:2308.02127},
year = {2023}
}