The Distance Matrices of Some Graphs Related to Wheel Graphs
Let D denote the distance matrix of a connected graph G. The inertia of D is the triple of integers (n+(D), n0(D), n-(D)), where n+(D), n0(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 s...
Furkejuvvon:
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Wiley
2013-01-01
|
| Ráidu: | Journal of Applied Mathematics |
| Liŋkkat: | http://dx.doi.org/10.1155/2013/707954 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|