On the 3--Critical Graphs of Order
arXiv:1103.2415
Abstract
Let be the total domination number of graph , a graph is -total domination vertex critical (or\ just\ --critical) if , and for any vertex of that is not adjacent to a vertex of degree one, . Mojdeh and Rad \cite{MR06} proposed an open problem: Does there exist a 3--critical graph of order with odd? In this paper, we prove that there exists a 3--critical graph of order with odd .
This paper was accpted by Utilitas Mathematica in 2008