On simple MCD graphs containing a subgraph homeomorphic to \(K_ 4\) (Q1318821)

Let \(S_ n\) be the set of simple graphs of order \(n\) in which no two cycles have the same length. A graph \(G\) in \(S_ n\) is called a simple maximum cycle-distributed (MCD) graph if there is no graph \(H\) in \(S_ n\) with \(| E(H) |>| E(G) |\). The author proves that there exists a simple MCD graph of order \(n\) such that it is a 2-connected graph containing a homeomorph of \(K_ 4\) iff \(n \in \{10, 11, 14, 15, 16, 21, 22\}\). Let \(f^*(n)\) be the number of edges in a simple MCD graph of order \(n\). It is proved that, for each integer \(n\), \(17 \leq n \leq 22\), \(f^*(n)=n+[(\sqrt {8n-15}-3)/2]\).