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.
Recommendations
- The inertia of distance matrices of some graphs
- Graphs whose distance matrix has at most three negative eigenvalues
- Inertia and distance energy of line graphs of unicyclic graphs
- The inertia and energy of the distance matrix of a connected graph
- An inverse formula for the distance matrix of a wheel graph with an even number of vertices
Cites work
- Distance spectra and distance energies of iterated line graphs of regular graphs
- scientific article; zbMATH DE number 4021200 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3627232 (Why is no real title available?)
- scientific article; zbMATH DE number 3641472 (Why is no real title available?)
- On distance matrices and Laplacians
- On the Addressing Problem for Loop Switching
- On the distance matrix of a directed graph
- Recent results in the theory of graph spectra
- The inertia of distance matrices of some graphs
- Trees with structures
Cited in
(12)- Inertia and distance energy of line graphs of unicyclic graphs
- Graphs whose distance matrix has at most three negative eigenvalues
- On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices
- An inverse formula for the distance matrix of a wheel graph with an even number of vertices
- Distance spectra of graphs: a survey
- The inertia and energy of distance matrices of complete \(k\)-partite graphs
- The inertia and energy of the distance matrix of a connected graph
- On distance matrices of wheel graphs with an odd number of vertices
- An inverse formula for the distance matrix of a fan graph
- Distance Signatures of Extended and Co-extended Incidence Graphs of Affine Designs
- On eccentricity matrices of wheel graphs
- Inertia and energy of the distance matrix
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)