Acta mathematica scientia,Series A ›› 2009, Vol. 29 ›› Issue (2): 297-302.

• Articles • Previous Articles     Next Articles

On Maximum γt - Critical Graphs

  

  1. (Department of Mathematics and Statistics, Central China Normal University, Wuhan 430079)
  • Received:2007-10-11 Revised:2008-12-06 Online:2009-04-25 Published:2009-04-25
  • Supported by:

    国家自然科学基金(10671081, 10571071)资助.

Abstract:

A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G-v is less than that of G. These graphs are called γt-critical. If such a graph G has total domination number k,  it is called k-γt-critical. In this paper, the authors give the structure proof of those graphs satisfying n=Δ(G)(γt(G)-1)+1.

CLC Number: 

  • 05C69
Trendmd