Upper bound on the diameter of a total domination vertex critical graph

作者：Furuya Michitaka^*; Kato Naoya

来源：Ars Combinatoria, 2016, 128: 349-371.

• total domination vertex critical graph
• total domination
• diameter

A vertex of a graph is said to be total domination critical if its deletion decreases the total domination number. A graph is said to be total domination vertex critical if all of its vertices except the supporting vertices are total domination vertex critical. We show that if G is a connected total domination vertex critical graph with total domination number k >= 4, then the diameter of G is at most left perpendicular 5k-7/3 right perpendicular.

• 出版日期2016-7