An extremal problem for total domination stable graphs upon edge removal期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

An extremal problem for total domination stable graphs upon edge removal

Authors:	Wyatt J. Desormeaux Teresa W. Haynes

Affiliation:	^a Department of Mathematics, University of Johannesburg, P.O. Box 524, Auckland Park, 2006, South Africa ^b Department of Mathematics, East Tennessee State University, Johnson City, TN 37614-0002, USA

Abstract:	A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine the minimum number of edges required for a total domination stable graph in terms of its order and total domination number.

Keywords:	Total domination Edge removal stable Extremal problem
本文献已被 ScienceDirect 等数据库收录！