Dierentiating-Dominating sets in graphs Under binary operations
Main Article Content
Abstract
Article Details
References
M. Frick, C. M. Mynhardt and R. D Skaggs, Critical graphs with respect to vertex identification, Utilitas Math., 76 (2008), 213--227.
D. Geoffroy, Nuclei for totally point distinguishing graphs, Discrete Math., 21(1978),145--162.
J. Gimbel, B. D. van Gorden, M. Nicolescu, C. Umstead, and N. Vaiana, Location with dominating sets, Congr. Numer., 151(2001), 129-144.
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998.
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998.
M. A. Henning, John McCoy, Which trees have a differentiating-paired dominating set? Journal of Combinatorial Optimization, 22(2011), Number 1,1--18.
D. P. Sumner, Point determination in graphs, Discrete Math., 5(1973),179-187.
M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, On a new class of codes for identifying vertices in graphs}, IEEE Trans. Inform. Theory, 44(2) (1998), 599--611.