The distance matrices of some graphs related to wheel graphs (Q364474): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q591531
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Xiao-Ling Zhang / rank
 
Normal rank

Revision as of 20:27, 19 February 2024

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
    0 references
    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

    Identifiers