Affiliation of Author(s):理学院
Journal:DISCRETE MATHEMATICS
Key Words:Domination game gamma(g)-maximal graph Supportive dominating set Starlike tree
Abstract:Let gamma(G) and gamma(g)(G) be the domination number and the game domination number of a graph G, respectively. In this paper gamma(g)-maximal graphs are introduced as the graphs G for which gamma(g)(G) = 2 gamma(G) - 1 holds. Large families of gamma(g)-maximal graphs are constructed among the graphs in which their sets of support vertices are minimum dominating sets. gamma(g)-maximal graphs are also characterized among the starlike trees, that is, trees which have exactly one vertex of degree at least 3. (C) 2017 Elsevier B.V. All rights reserved.
ISSN No.:0012-365X
Translation or Not:no
Date of Publication:2018-06-01
Co-author:李霞,Klavzar, Sandi
Correspondence Author:Klavzar, Sandi,Kexiang Xu