Constructing goal-minimally \(k\)-diametric graphs by lifts (Q1759397): Difference between revisions

A graph \(G\) is goal-minimal of diameter \(k\) (\(k\)-GMD) if the diameter of \(G\) is equal to \(k\) and for every edge \(uv\in E(G)\) the inequality \(d_{G-uv}(x,y)>k\) holds if and only if \(\{\;u,v\}=\{x,y\}\). This paper shows how to obtain some known infinite families of 1-GMD, 2-GMD and 4-GMD graphs from lifts and presents a first infinite family of 5-GMD graphs. It also gives several examples of \(k\)-GMD for \(k \leq 10\), \(k=13\) and \(k=14\) constructed by lifts. Some more GMD graphs are discussed.