|
|
|
|
total k-distance domination critical graphs
|
|
|
|
|
|
|
|
نویسنده
|
mojdeh doost ali ,mojdeh doost ali ,sayed-khalkhali a. ,abdollahzadeh ahangar hossein ,zhao yancai
|
|
منبع
|
transactions on combinatorics - 2016 - دوره : 5 - شماره : 3 - صفحه:1 -9
|
|
چکیده
|
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
|
|
کلیدواژه
|
distance domination; total k-distance dominating set; total k-distance domination-critical
|
|
آدرس
|
university of mazandaran, department of mathematics, ایران. tafresh university, department of mathematics, ایران, university of mazandaran, department of mathematics, ایران. tafresh university, department of mathematics, ایران, tafresh university, department of mathematics, ایران, babol noshirvani university of technology, department of basic science, ایران, wuxi city college of vocational technology, department of basic science, china
|
|
پست الکترونیکی
|
zhaoyc69@126.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|