Total domination number of middle graphs

Kazemnejad, Farshad; Pahlavsay, Behnaz; Palezzato, Elisa et al.

Electronic Journal of Graph Theory and Applications, 2022, 10(1), 275-288

Permalink : https://hdl.handle.net/2115/86066

このアイテムのアクセス数:265件（2026-08-15 13:38 集計）

ファイル	フォーマット	サイズ	閲覧回数	説明
https://doi.org/10.5614/ejgta.2022.10.1.19			12

アクセス権	open access
URI	https://hdl.handle.net/2115/86066
タイトル	Total domination number of middle graphs
著者	Kazemnejad, Farshad ; Pahlavsay, Behnaz ; Palezzato, Elisa ; Torielli, Michele
著者名 Kazemnejad, Farshad
著者名 Pahlavsay, Behnaz
著者名 Palezzato, Elisa
著者名 Torielli, Michele
言語	英語
キーワード	total domination number
	middle graph
	Nordhaus-Gaddum-like relation
発行日	2022
出版者	Institut Teknologi Bandung
収録物名	Electronic Journal of Graph Theory and Applications
巻(号)	10(1)
ページ	275-288
抄録	A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set of G. In this paper, we study the total 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 total domination number of the middle graph of some known families of graphs explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of middle graphs.
資源タイプ	学術雑誌論文
出版タイプ	Version of Record
PISSN	2338-2287
関連情報 (isIdenticalTo)	出版社版DOI https://doi.org/10.5614/ejgta.2022.10.1.19