Determining finite connected graphs along the quadratic embedding constants of paths
DOI10.5614/ejgta.2021.9.2.23zbMath1482.05188arXiv1904.08059OpenAlexW3205945423MaRDI QIDQ5061709
Edy Tri Baskoro, Nobuaki Obata
Publication date: 14 March 2022
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.08059
claw-free graphsdistance matrixconditionally negative definite matrixquadratic embedding constantstar product graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distance spectra of graphs
- On Euclidean distance matrices
- An example of a non nuclear C*-algebra, which has the metric approximation property
- Distance-regular graphs the distance matrix of which has only one positive eigenvalue
- Claw-free graphs---a survey
- Euclidean graph distance matrices of generalizations of the star graph
- On quadratic embedding constants of star product graphs
- Distance spectra of graphs: a survey
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Markov product of positive definite kernels and applications to Q-matrices of graph products
- Positive-definite kernels, length functions on groups and a noncommutative von Neumann inequality
- Positive Q-matrices of graphs
- Distance matrices and quadratic embedding of graphs
- Quadratic Embedding Constants of Wheel Graphs
- Euclidean Distance Geometry and Applications
- Geometry of cuts and metrics
This page was built for publication: Determining finite connected graphs along the quadratic embedding constants of paths