Quadratic Embedding Constants of Strongly Regular Graphs
Nobuaki Obata

TL;DR
This paper derives an explicit formula for the quadratic embedding constant of strongly regular graphs and characterizes when such graphs can be embedded into Euclidean space based on this constant.
Contribution
It provides a new explicit formula for the quadratic embedding constant of strongly regular graphs and a criterion for their Euclidean embedding.
Findings
Explicit formula for QEC of strongly regular graphs
Necessary and sufficient condition for Euclidean embedding
Enhanced understanding of graph embedding properties
Abstract
We obtain an explicit formula for the quadratic embedding constant (QEC) of a strongly regular graph with . By using QEC we give a necessary and sufficient condition for a strongly regular graph to admit a quadratic embeddingin a Euclidean space.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Finite Group Theory Research · graph theory and CDMA systems
