Power Domination Number On Shackle Operation with Points as Lingkage
DOI:
https://doi.org/10.31764/jtam.v4i1.1579Keywords:
Power Dominating Number, Shackle Operation Graph with Points as Lingkage.Abstract
The Power dominating set is a minimum point of determination in a graph that can dominate the connected dots around it, with a minimum domination point. The smallest cardinality of a power dominating set is called a power domination number with the notation . The purpose of this study is to determine the Shackle operations graph value from several special graphs with a point as a link. The result operation graphs are: Shackle operation graph from Path graph , Shackle operation graph from Sikel graph , Shackle operation graph from Star graph . The method used in this paper is axiomatic deductive method in solving problems. Understanding the axiomatic method itself is a method of deductive proof principles that applies in mathematical logic by using theorems that already exist in solving a problem. In this paper begins by determining the paper object that is the Shackle point operations result graph. Next, determine the cardinality of these graphs. After that, determine the point that has the maximum degree on the graph as the dominator point of power domination. Then, check whether the nearest neighbor has two or more degrees and analyze its optimization by using a ceiling function comparison between zero forching with the greatest degree of graph. Thus it can be determined ϒp minimal and dominated. The results of the power domination number study on Shackle operation graph result with points as connectors are , for  and ; , for  and ; , for  and .References
Bawono, D. A. (2017). Power Domination Number Pada Graf Hasil Operasi Comb Sisi Dikaitkan Dengan Keterampilan Berpikir Tingkat Tinggi. Jember: Universitas Jember.
Benson, K. F., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevska, V., & Wissman, B. (2015). Power domination and zero forcing. 1–10.
Benson, K. F., Ferrero, D., Flagg, M., Furst, V., Hogben, L., Vasilevska, V., & Wissman, B. (2018). Zero forcing and power domination for graph products. Australasian Journal of Combinatorics, 70(2), 221–235.
Bozeman, C., Brimkov, B., Erickson, C., Ferrero, D., Flagg, M., & Hogben, L. (2019). Restricted power domination and zero forcing problems. Journal of Combinatorial Optimization, 37(3), 935–956. https://doi.org/10.1007/s10878-018-0330-6
Chang, G. J., Dorbec, P., Montassier, M., & Raspaud, A. (2012). Generalized power domination of graphs. Discrete Applied Mathematics, 160(12), 1691–1698. https://doi.org/10.1016/j.dam.2012.03.007
Department, J. S. (2012). Deception Tactics for Network Interdiction: A Multiobjective Approach. Networks, 60(1), 45–58. https://doi.org/10.1002/net
Dorbec, P., Henning, M. A., Löwenstein, C., Montassier, M., & Raspaud, A. (2013). Generalized power domination in regular graphs. SIAM Journal on Discrete Mathematics, 27(3), 1559–1574. https://doi.org/10.1137/120891356
Dorbec, P., & Klavžar, S. (2014). Generalized Power Domination: Propagation Radius and Sierpiński Graphs. Acta Applicandae Mathematicae, 134(1), 75–86. https://doi.org/10.1007/s10440-014-9870-7
Ferrero, D., Hogben, L., Kenter, F. H. J., & Young, M. (2017a). Note on power propagation time and lower bounds for the power domination number. Journal of Combinatorial Optimization, 34(3), 736–741. https://doi.org/10.1007/s10878-016-0103-z
Ferrero, D., Hogben, L., Kenter, F. H. J., & Young, M. (2017b). The relationship between $k$-forcing and $k$-power domination. 1–15.
Ferrero, D., Varghese, S., & Vijayakumar, A. (2011). Power domination in honeycomb networks. Journal of Discrete Mathematical Sciences and Cryptography, 14(6), 521–529. https://doi.org/10.1080/09720529.2011.10698353
Imelda Roza, Narwen, Z. (2014). Graf Garis (Line Graph) dari Graf Siklus, Graf Lengkap dan Graf Bintang. Jurnal Matematika UNAND, 3(2), 2–5.
Lestari, K. E. (2015). Analisis Kemampuan Pembuktian Matematis Mahasiswa Menggunakan Pendekatan Induktif-Deduktif Pada Mata Kuliah Analisis Real. MENDIDIK: Jurnal Kajian Pendidikan Dan Pengajaran, 1(2), 128–135.
Munir, & Rinaldi. (2012). Matematika Diskrit. Bandung: Departemen Teknik Informatika Institut Teknologi Bandung.
Seema, V., & A.Vijayakumar. (2011). Power domination in some classes of graphs. EuroComb’11, 15(2), 80–89.
Slamin, Dafik, & Waspodo, G. A. (2018). Distance Domination Number of Graphs Resulting from Edge Comb Product. Journal of Physics: Conference Series, 1022(1). https://doi.org/10.1088/1742-6596/1022/1/012008
Stephen, S., Rajan, B., Ryan, J., Grigorious, C., & William, A. (2015). Power domination in certain chemical structures. Journal of Discrete Algorithms, 33, 10–18. https://doi.org/10.1016/j.jda.2014.12.003
Wang, C., Chen, L., & Lu, C. (2016). k-Power domination in block graphs. Journal of Combinatorial Optimization, 31(2), 865–873. https://doi.org/10.1007/s10878-014-9795-0
Yang, H., & Marzetta, T. L. (2013). Performance of conjugate and zero-forcing beamforming in large-scale antenna systems. IEEE Journal on Selected Areas in Communications, 31(2), 172–179. https://doi.org/10.1109/JSAC.2013.130206
Zou, F., Wang, Y., Xu, X. H., Li, X., Du, H., Wan, P., & Wu, W. (2011). New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theoretical Computer Science, 412(3), 198–208. https://doi.org/10.1016/j.tcs.2009.06.022
Downloads
Published
Issue
Section
License
Authors who publish articles in JTAM (Jurnal Teori dan Aplikasi Matematika) agree to the following terms:
- Authors retain copyright of the article and grant the journal right of first publication with the work simultaneously licensed under a CC-BY-SA or The Creative Commons Attribution–ShareAlike License.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
