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

preprint2011arXivOpen access

Abstract

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

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.