On the 3-γt-Critical Graphs of Order (G)+3

Abstract

Let γt(G) be the total domination number of graph G, a graph G is k-total domination vertex critical (or\ just\ k-γt-critical) if γt(G)=k, and for any vertex v of G that is not adjacent to a vertex of degree one, γt(G-v)=k-1. Mojdeh and Rad MR06 proposed an open problem: Does there exist a 3-γt-critical graph G of order (G)+3 with (G) odd? In this paper, we prove that there exists a 3-γt-critical graph G of order (G)+3 with odd (G)≥ 9.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…