Contents

-

On Questions on (Total) Domination Vertex Critical Graphs

Doost Ali Mojdeh1, Roslan Hasni1
1School of Mathematical Sciences University Sains Malaysia, 11800 Penang, Malaysia

Abstract

Let G=(V,E) be a graph. Let γ(G) and γt(G) be the domination and total domination number of a graph G, respectively. The γ-criticality and γt-criticality of Harary graphs are studied. The Question 2 of the paper [W. Goddard et al., The Diameter of total domination vertex critical graphs, Discrete Math. 286(2004),255261] is fully answered with the family of Harary graphs. It is answered to the second part of Question 1 of that paper with some Harary graphs.