A set of edges of a graph is a matching if no two edges in are incident to the same vertex. The matching number of is the maximum cardinality of a matching of . A set of vertices in is a total dominating set if every vertex of is adjacent to some vertex in . The minimum cardinality of a total dominating set of is the total domination number of . We prove that if all vertices of belong to a triangle, then the total domination number of is bounded above by its matching number. We in fact prove a slightly stronger result and as a consequence of this stronger result, we prove a Graffiti conjecture that relates the total domination and matching numbers in a graph.