GRAPH TANGGA DAN SIFAT-SIFATNYA

DOI: https://doi.org/10.24843/MTK.2023.v12.i03.p416

Abstract

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.

Downloads

Download data is not yet available.

Author Biographies

MARETA SEKAR LARASATI, Universitas Udayana

Program Studi Matematika, Fakultas MIPA – Universitas Udayana

LUH PUTU IDA HARINI, Universitas Udayana

Program Studi Matematika, Fakultas MIPA – Universitas Udayana

I WAYAN SUMARJAYA, Universitas Udayana

Program Studi Matematika, Fakultas MIPA – Universitas Udayana

Published
2023-08-23
How to Cite
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. Available at: <https://ojs.unud.ac.id/index.php/mtk/article/view/93567>. Date accessed: 19 may 2024. doi: https://doi.org/10.24843/MTK.2023.v12.i03.p416.
Citation Formats
Issue
Vol 12 No 3 (2023)
Section
Articles
Creative Commons License

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

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

Most read articles by the same author(s)

1 2 3 4 > >>