The distance matrices of some graphs related to wheel graphs (Q364474)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6206841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The distance matrices of some graphs related to wheel graphs |
scientific article; zbMATH DE number 6206841 |
Statements
The distance matrices of some graphs related to wheel graphs (English)
0 references
9 September 2013
0 references
Summary: Let \(D\) denote the distance matrix of a connected graph \(G\). The inertia of \(D\) is the triple of integers (\(n_+(D)\), \(n_0(D)\), \(n_{-}(D)\)), where \(n_+(D)\), \(n_0(D)\), and \(n_{-}D\) denote the number of positive, 0, and negative eigenvalues of \(D\), respectively. In this paper, we mainly study the inertia of distance matrices of some graphs related to wheel graphs and give a construction for graphs whose distance matrices have exactly one positive eigenvalue.
0 references
distance matrix
0 references
wheel graph
0 references
eigenvalues
0 references
0.9295483231544496
0 references
0.8690722584724426
0 references
0.8296105861663818
0 references
0.8189090490341187
0 references
0.8131906390190125
0 references
