加载中…
The quadratic embedding property of graphs consisting of three paths (theta graphs) is fully characterised. For this aim, a theorem by Winkler (1985) is utilized. An alternative proof of that result using the RKHS technique is presented.

生成讲解博客的中文版本

生成AI智能校验的中文版本