Complete multipartite graphs of non-QE class
From MaRDI portal
Abstract: We derive a formula for the QE constant of a complete multipartite graph and determine the complete multipartite graphs of non-QE class, namely, those which do not admit quadratic embeddings in a Euclidean space. Moreover, the primary non-QE graphs are specified among the complete multipartite graphs.
Recommendations
Cites work
- Complete multipartite graphs are determined by their distance spectra
- Determining finite connected graphs along the quadratic embedding constants of paths
- Distance matrices and quadratic embedding of graphs
- Distance spectra of graphs: a survey
- Euclidean distance geometry and applications
- Euclidean distance matrices and their applications in rigidity theory
- Euclidean graph distance matrices of generalizations of the star graph
- Metric Spaces and Positive Definite Functions
- On Euclidean distance matrices
- On Euclidean distance matrices of graphs
- On quadratic embedding constants of star product graphs
- On the distance spectrum of graphs
- Quadratic embedding constants of graph joins
- Quadratic embedding constants of path graphs
- Quadratic embedding constants of wheel graphs
Cited in
(8)- A quadratic form characterization of completeN-partite graphs
- Primary non-QE graphs on six vertices
- On quadratic embeddability of bipartite graphs and theta graphs
- A classification of graphs through quadratic embedding constants and clique graph insights
- Quadratic embedding constants of fan graphs and graph joins
- Quadratic embedding constants of corona graphs
- Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures
- Quadratic embedding constants of lexicographic product graphs
This page was built for publication: Complete multipartite graphs of non-QE class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090332)