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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
