
Summary: A connected graph is said to be of QE class if it admits a quadratic embedding in a Hilbert space, or equivalently if the distance matrix is conditionally negative definite, or equivalently if the quadratic embedding constant (QEC) of a graph is non-positive. The QEC of wheel graphs are calculated explicitly.
Connectivity, distance matrix, QE constant, Graphs and linear algebra (matrices, eigenvalues, etc.), Graph operations (line graphs, products, etc.), quadratic embedding, conditionally negative definite matrix, wheel graph, Combinatorial aspects of matrices (incidence, Hadamard, etc.)
Connectivity, distance matrix, QE constant, Graphs and linear algebra (matrices, eigenvalues, etc.), Graph operations (line graphs, products, etc.), quadratic embedding, conditionally negative definite matrix, wheel graph, Combinatorial aspects of matrices (incidence, Hadamard, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
