2023/08/04 by Farshad Kazemnejad, Kazemnejad, Farshad, Behnaz Pahlavsay +5
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2308.02127
openalex publication_date 2023/08/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.