1
$\begingroup$

Consider all connected simple graphs with diameter $d = 2$ and maximal vertex degree $\Delta$. In my particular practical case $\Delta = 4$, but general problem is much more interesting — probably there exists a research on general case.

I know that, given $d = 2$ and $\Delta = 4$, the maximal number of vertices in the proper graph is $V = 15$ (the corresponding graph is K3 * C5). The question is: given $V$, how can one find the proper $V$-vertex graph with minimal number of edges?

I wrote the simple brute-force program and found the answer for all $V \le 8$. But calculating it further using this approach is going to take a tremendous amount of time, so I decided to ask the community for any advices or links to researches. Thank you for any assistance.

P.S. Sorry, if my English wasn't understandable enough.

P.P.S. Firstly I asked this question at MathOverflow, but later I realized that it would be more appropriate here. Sorry for redundancy.

  • 0
    $K_3 * C_5$ has diameter 3, not 2.2018-11-19

1 Answers 1

1

This is very similar to the graph diameter problem. You'll probably find your answer in the realm of Distance Regular Graphs, since minimal/maximal solutions in graph theory tend to have a lot of symmetry.