English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we study the total outer-connected domination number of themiddle graph of a simple graph and we obtain tight bounds for this number interms of the order of the middle graph. We also compute the totalouter-connected domination number of some families of graphs, explicitly.Moreover, some Nordhaus-Gaddum-like relations are presented for the totalouter-connected domination number of middle graphs.

Total outer-connected domination number of middle graphs