DOMINATION NUMBER OF MIDDLE GRAPHS

Farshad Kazemnejad; Behnaz Pahlavsay; Elisa Palezzato; Michele Torielli

doi:10.22108/TOC.2022.131151.1927

DOMINATION NUMBER OF MIDDLE GRAPHS

Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli

Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

In this paper, we study the 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 domination number of some families of graphs such as star graphs, double start graphs, path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the domination number of middle graphs.

Original language	English (US)
Pages (from-to)	79-91
Number of pages	13
Journal	Transactions on Combinatorics
Volume	12
Issue number	2
DOIs	https://doi.org/10.22108/TOC.2022.131151.1927
State	Published - Jun 2023

Keywords

Domination number
Middle graph
Nordhaus-Gaddum-like relation

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.22108/TOC.2022.131151.1927

Cite this

@article{efd9119b8b8644439a8dea78720a6e58,

title = "DOMINATION NUMBER OF MIDDLE GRAPHS",

abstract = "In this paper, we study the 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 domination number of some families of graphs such as star graphs, double start graphs, path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the domination number of middle graphs.",

keywords = "Domination number, Middle graph, Nordhaus-Gaddum-like relation",

author = "Farshad Kazemnejad and Behnaz Pahlavsay and Elisa Palezzato and Michele Torielli",

note = "Publisher Copyright: {\textcopyright} 2022 University of Isfahan.",

year = "2023",

month = jun,

doi = "10.22108/TOC.2022.131151.1927",

language = "English (US)",

volume = "12",

pages = "79--91",

journal = "Transactions on Combinatorics",

issn = "2251-8657",

publisher = "University of Isfahan",

number = "2",

}

TY - JOUR

T1 - DOMINATION NUMBER OF MIDDLE GRAPHS

AU - Kazemnejad, Farshad

AU - Pahlavsay, Behnaz

AU - Palezzato, Elisa

AU - Torielli, Michele

PY - 2023/6

Y1 - 2023/6

N2 - In this paper, we study the 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 domination number of some families of graphs such as star graphs, double start graphs, path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the domination number of middle graphs.

AB - In this paper, we study the 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 domination number of some families of graphs such as star graphs, double start graphs, path graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the domination number of middle graphs.

KW - Domination number

KW - Middle graph

KW - Nordhaus-Gaddum-like relation

UR - https://www.scopus.com/pages/publications/105018951313

UR - https://www.scopus.com/inward/citedby.url?scp=105018951313&partnerID=8YFLogxK

U2 - 10.22108/TOC.2022.131151.1927

DO - 10.22108/TOC.2022.131151.1927

M3 - Article

AN - SCOPUS:105018951313

SN - 2251-8657

VL - 12

SP - 79

EP - 91

JO - Transactions on Combinatorics

JF - Transactions on Combinatorics

IS - 2

ER -

DOMINATION NUMBER OF MIDDLE GRAPHS

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this