Quadratic Embedding of Theta Graphs via Reproducing Kernel Hilbert Spaces
arXiv:2603.23681
Abstract
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.