The distance matrices of some graphs related to wheel graphs

From MaRDI portal
(Redirected from Publication:364474)





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.











This page was built for publication: The distance matrices of some graphs related to wheel graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364474)