The distance matrices of some graphs related to wheel graphs (Q364474): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C12 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6206841 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
distance matrix | |||
| Property / zbMATH Keywords: distance matrix / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
wheel graph | |||
| Property / zbMATH Keywords: wheel graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
eigenvalues | |||
| Property / zbMATH Keywords: eigenvalues / rank | |||
Normal rank | |||
Revision as of 11:20, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The distance matrices of some graphs related to wheel graphs |
scientific article |
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
