GRAPH TANGGA DAN SIFAT-SIFATNYA

##plugins.pubIds.doi.readerDisplayName## https://doi.org/10.24843/MTK.2023.v12.i03.p416

Abstrak

Ladder Graph is one type of connected and simple graph that has its own uniqueness. The aim of this research is to find the k-deficiency of points in the spanning tree in the ladder graph. Calculation of k-deficiency is carried out for each additional step, starting from the second ladder ( L2), up to the nth Ladder (Ln). Calculations are based on a representative spanning tree on each ladder. In the end, we get a number pattern from the second ladder onwards which is then proven by mathematical induction, for the calculation of each step up the ladder. In this study, the pattern of k-deficiency points on the ladder graph was obtained.

##plugins.generic.usageStats.downloads##

##plugins.generic.usageStats.noStats##

##submission.authorBiographies##

##submission.authorWithAffiliation##

Program Studi Matematika, Fakultas MIPA – Universitas Udayana

##submission.authorWithAffiliation##

Program Studi Matematika, Fakultas MIPA – Universitas Udayana

##submission.authorWithAffiliation##

Program Studi Matematika, Fakultas MIPA – Universitas Udayana

Diterbitkan
2023-08-23
##submission.howToCite##
LARASATI, MARETA SEKAR; HARINI, LUH PUTU IDA; SUMARJAYA, I WAYAN. GRAPH TANGGA DAN SIFAT-SIFATNYA. E-Jurnal Matematika, [S.l.], v. 12, n. 3, p. 177-181, aug. 2023. ISSN 2303-1751. Tersedia pada: <http://103.29.196.112/index.php/mtk/article/view/93567>. Tanggal Akses: 05 mar. 2026 doi: https://doi.org/10.24843/MTK.2023.v12.i03.p416.
##submission.howToCite.citationFormats##
Terbitan
Vol 12 No 3 (2023)
Bagian
Articles
##submission.license.cc.by4.footer##

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

##plugins.generic.recommendByAuthor.heading##

<< < 1 2 3 4 5 > >>