![Sample our Bioscience journals, sign in here to start your access, Latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5925/TOC-Subject-Sample-2021-Bioscience.jpg"})
Abstract
In this paper, the completion problems for chordal graphs and block graphs are discussed using graph theory. Based on the completion theorem for 1-chordal graph, we give the completion theorems for 2-chordal graph and 3-chordal graph, make the completion problem extend to n-chordal graph. We also give the definition of block graph and discuss the completion for 1-chordal block graph, 2-chordal block graph, and 3-chordal block graph. The corresponding algorithms that can be used to get the completions are also presented.