September 30, 2022
Author(s)
James Shook, Bing Wei
A graph is $k$-chordal if it does not have an induced cycle with length greater than $k$. We call a graph chordal if it is $3$-chordal. Let $G$ be a graph. The distance between the vertices $x$ and $y$, denoted by $d_G}(x,y)$, is the length of a shortest