DETERMINATION OF DOMINANT SIDE CONTRACTION NUMBERS IN BANANA TREE AND FIRECRACKER GRAPES
Abstract
This research aims to determine the pattern of dominance side contraction numbers
in banana tree graphs and fireworks graphs. Banana tree graph Bn,,k is a graph obtained by connecting one leaf from each n-copies of a k star graph with one vertex that is different from all the star graphs. The fireworks graph is a tree that is similar to the caterpillar graph, the difference lies in the backbone node n which is connected to the earring node k from the caterpillar graph. The dominating number is denoted by γ ( G ) is the smallest cardinality of a dominating set. Domination set The minimum is a dominating set from which no points can be removed without changing its dominance. Domination contraction number of a graph ctγ ( G ) is defined as the minimum number of edges that must be contracted to reduce the dominance number .
Keywords
Full Text:
PDFReferences
Adawiyah, R., (2016): Determination of Edge Dominance Numbers in Graphs Results of Tensor Product Operations, Thesis , (SM 142501).
Azhar, RF, (2019): Server Center Placement in Jember Regency Using Dominated Number Theory, Mathematics , 1–8.
Budi Santoso, Djuwandi, RHSU, (2012): Domination Numbers and Freedom Numbers of Cubic Bipartite Graphs, Mathematics , 15 (01), 12–16.
Deo, N., (1989): Graph Theory with Applications to Engineering and Computer Science , Prentice Hall International, USA. .
Dwi Agustin Wardani, Ika Hesti Agustin, D., (2014): Domination Numbers from Special Graphs, Sainsmat , 01 (05), 79–84.
Gary Chartrand, LL, (1986): Graph and Digraph , 2, Wadsworth. Inc., California.
Grimaldi, R., (1985): Discrete and Combinatorial Mathematics , RHI, New York.
Haynes, W.T., (1996): Fundamentals of Dominations in Graphs , MarcelDekker, Inc, New York.
I. Yesi, IW Sudarsana, SM, (2016): Tringular Total Labeling in Several Classes of Tree Graphs, Sainsmat , 13 (02), 17–24.
Jia Huang, JMX, (2010): Dominating and Total Dominating Contraction Numbers of Graphs, Sainsmat , .
Landerius Maroa, OHY, (2021): Application of the Dominance Set Concept in Graph Theory to Optimize the Number of Drinking Water Pipe Leaks in Mausamang Village, Alor Regency, Dry Land Science Journal , 04 (02), 16–18.
Munir, R., (2005): Discrete Mathematics , Informatics Bandung, Bandung.
Munir, R., (2009): Discrete Mathematics , Informatics Bandung, Bandung.
N. Harsfield, GR, (1994): Pearls in Graphs Theory: A Comprehensive Introduction, Revised and Augmented , Academic Press, San Diego.
Oktavia, SD, (2014): Domination Side Contraction Numbers in Graphs, Mathematics , .
Prasetyawati, D., (2014): Contractions in Ladder Graphs ( Ln ) and Pinwheel Graphs ( K 1+ mK 2) Mathematics , .
Purwanto (1998): Discrete Mathematics , IKIP Malang, Malang.
Qomariyah, NF, (2019): Edge Dominance Numbers in Antiprism Graphs (APn) , UIN Syarief Hidayatullah Jakarta press, Jakarta.
Reni Umilasari, Ilham Saifudin, AA, (2022): Application of Two Distance Dominated Number Theory to Selecting Locations for Online Motorbike Taxi Bases, Journal of Mathematics Education and Science , 05 (02), 137–145.
Rosen, K., (2012): Discrete Mathematics and Its Applications, , 7, McGrawHill, New York.
Susanti, S., (2014): Total Dominance Side Contraction Numbers in Graphs, Mathematics ,
Vasudev, C., (2006): Graph Theory with Application , New Age International Publisher, New Delhi.
Yesi Januarti, Mariatul Kiftiah, NK, (2015): Roman Domination Function on the Line
Graph, Sainsmat , 04 (02), 119–126.
DOI: http://dx.doi.org/10.30829/zero.v7i2.17770
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Department of Mathematics
Faculty of Science and Technology
Universitas Islam Negeri Sumatera Utara Medan
Email: mtk.saintek@uinsu.ac.id