



















We compute the quadratic embedding constant for complete bipartite graphs with disjoint edges removed. Moreover, we study the quadratic embedding property for theta graphs, i.e., graphs consisting of three paths with common initial points and common endpoints. As a result, we provide an infinite family of primary graphs which are not quadratically embeddable.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。