Mareta Sekar Larasati, Luh Putu, Ida Harini, Wayan Sumarjaya
{"title":"视距图","authors":"Mareta Sekar Larasati, Luh Putu, Ida Harini, Wayan Sumarjaya","doi":"10.24843/mtk.2023.v12.i03.p416","DOIUrl":null,"url":null,"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.","PeriodicalId":11600,"journal":{"name":"E-Jurnal Matematika","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"GRAPH TANGGA DAN SIFAT-SIFATNYA\",\"authors\":\"Mareta Sekar Larasati, Luh Putu, Ida Harini, Wayan Sumarjaya\",\"doi\":\"10.24843/mtk.2023.v12.i03.p416\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":11600,\"journal\":{\"name\":\"E-Jurnal Matematika\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"E-Jurnal Matematika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24843/mtk.2023.v12.i03.p416\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"E-Jurnal Matematika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24843/mtk.2023.v12.i03.p416","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
