Bilangan Dominasi Graf Hasil Operasi Korona Sisi
P. Pavlič and J. Žerovnik, “A note on the domination number of the cartesian products of paths and cycles,” Kragujev. J. Math., vol. 37, no. 2, pp. 275–285, 2013.
C. E. Go and S. R. jun. Canoy, “Domination in the corona and join of graphs.,” Int. Math. Forum, vol. 6, no. 13–16, pp. 763–771, 2011.
A. Klobucar, “Domination numbers of cardinal product,” Math. Slovaca, vol. 49, no. 4, pp. 387–402, 1999.
D. Kuziak, M. Lemanska, and I. G. Yero, “Domination related parameters in rooted product graphs,” pp. 1–18, 2012.
S. K. Vaidya and N. J. Kothari, “Distance $k$-domination in some cycle related graphs,” Miskolc Math. Notes, vol. 19, no. 2, p. 1223, 2018.
E. Prathibha, S. P. Missier, and A. A. Kinsley, “Algorithms to determine the distance-t dominating sets of ES(n, k),” Procedia Comput. Sci., vol. 47, no. C, pp. 342–350, 2015.
G. Chartrand and L. Lesniak, “Graphs & Digraphs,” p. 429, 2000.
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamental of Domination in Grpahs. 1998.
Y. Hou and W. C. Shiu, “The Spectrum of The Edge Corona of Two Graphs,” Electron. J. Linear Algebr., vol. 20, pp. 586–594, 2010.
R. Davila, C. Fast, M. A. Henning, and F. Kenter, “Lower bounds on the distance domination number of a graph,” Contrib. to Discret. Math., vol. 12, no. 2, pp. 11–21, 2017.
- There are currently no refbacks.
Limits: Journal Mathematics and its Aplications by Pusat Publikasi Ilmiah LPPM Institut Teknologi Sepuluh Nopember is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Based on a work at https://iptek.its.ac.id/index.php/limits.