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 .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.