Papers
Topics
Authors
Recent
Search
2000 character limit reached

Total outer-connected domination number of middle graphs

Published 4 Aug 2023 in math.CO | (2308.02127v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up