Quadratic Embedding of Theta Graphs via Reproducing Kernel Hilbert Spaces
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.