Title of article
Total k-distance domination critical graphs
Author/Authors
Mojdeh، Doost Ali نويسنده Department of Mathematics,University of Mazandaran,Babolsar,Iran , , Sayed-Khalkhali، A. نويسنده Department of Mathematics,University of Tafresh,Tafresh,Iran , , Abdollahzadeh Ahangar، Hossein نويسنده Department of Basic Science,Babol University of Technology,Babol,Iran , , Zhao، Yancai نويسنده Department of Basic Science,Wuxi City College of Vocational Technology,Jiangsu,China ,
Issue Information
فصلنامه با شماره پیاپی سال 2016
Pages
9
From page
1
To page
9
Abstract
A set S of vertices in a graph G=(V,E) is called a total k-distance dominating set if every vertex in V is within distance k of a vertex in S. A graph G is total kk-distance domination-critical if γkt(G−x)<γkt(G) for any vertex x∈V(G). In this paper, we investigate some results on total k-distance domination-critical of graph
Journal title
Transactions on Combinatorics
Serial Year
2016
Journal title
Transactions on Combinatorics
Record number
2398003
Link To Document