|
Title
|
TOTAL k-DISTANCE DOMINATION CRITICAL GRAPHS
|
|
Type
|
JournalPaper
|
|
Keywords
|
Distance domination, total k-distance dominating set, total k-distance domination-critical.
|
|
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 k-distance domination-critical if k t (G x) < k t (G) for any vertex x 2 V (G). In this paper, we investigate some results on total k-distance domination-critical of graphs.
|
|
Researchers
|
Hossein ABDOLLAHZADEH AHANGAR (Third Researcher), Yancai Zhao (Fourth Researcher), Ashraf Seyed Khalkhali (Second Researcher), Doost Ali Mojdeh (First Researcher)
|