Euclidean graph distance matrices of generalizations of the star graph
From MaRDI portal
Publication:1644108
DOI10.1016/j.amc.2013.12.158zbMath1410.05129OpenAlexW1980622115MaRDI QIDQ1644108
Publication date: 21 June 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.12.158
Related Items (9)
On distance matrices of wheel graphs with an odd number of vertices ⋮ Determining finite connected graphs along the quadratic embedding constants of paths ⋮ Quadratic embedding constants of graph joins ⋮ Complete multipartite graphs of non-QE class ⋮ Unnamed Item ⋮ An inverse formula for the distance matrix of a wheel graph with an even number of vertices ⋮ Quadratic Embedding Constants of Wheel Graphs ⋮ On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices ⋮ Distance matrices and quadratic embedding of graphs
Cites Work
- On properties of cell matrices
- Methods for constructing distance matrices and the inverse eigenvalue problem
- Eigenvalues of nonnegative symmetric matrices
- A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem
- Circum-Euclidean distance matrices and faces
- Research Problems in Discrete Geometry
- Distance spectrum of graph compositions
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- Euclidean distance matrices: new characterization and boundary properties
- INVERSE EIGENVALUE PROBLEM FOR EUCLIDEAN DISTANCE MATRICES OF SIZE 3
- On the Addressing Problem for Loop Switching
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Euclidean graph distance matrices of generalizations of the star graph
