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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/707954 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849307672367595520 |
|---|---|
| author | Xiaoling Zhang Chengyuan Song |
| author_facet | Xiaoling Zhang Chengyuan Song |
| author_sort | Xiaoling Zhang |
| collection | DOAJ |
| description | 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 some graphs related to wheel graphs and give a construction for graphs whose distance matrices have exactly one positive eigenvalue. |
| format | Article |
| id | doaj-art-2186bfe5d5fc4ae480c10c062e04a3f9 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-2186bfe5d5fc4ae480c10c062e04a3f92025-08-20T03:54:42ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/707954707954The Distance Matrices of Some Graphs Related to Wheel GraphsXiaoling Zhang0Chengyuan Song1School of Mathematics and Information Science, Yantai University, Yantai, Shandong 264005, ChinaSchool of Mathematics and Information Science, Yantai University, Yantai, Shandong 264005, ChinaLet 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 some graphs related to wheel graphs and give a construction for graphs whose distance matrices have exactly one positive eigenvalue.http://dx.doi.org/10.1155/2013/707954 |
| spellingShingle | Xiaoling Zhang Chengyuan Song The Distance Matrices of Some Graphs Related to Wheel Graphs Journal of Applied Mathematics |
| title | The Distance Matrices of Some Graphs Related to Wheel Graphs |
| title_full | The Distance Matrices of Some Graphs Related to Wheel Graphs |
| title_fullStr | The Distance Matrices of Some Graphs Related to Wheel Graphs |
| title_full_unstemmed | The Distance Matrices of Some Graphs Related to Wheel Graphs |
| title_short | The Distance Matrices of Some Graphs Related to Wheel Graphs |
| title_sort | distance matrices of some graphs related to wheel graphs |
| url | http://dx.doi.org/10.1155/2013/707954 |
| work_keys_str_mv | AT xiaolingzhang thedistancematricesofsomegraphsrelatedtowheelgraphs AT chengyuansong thedistancematricesofsomegraphsrelatedtowheelgraphs AT xiaolingzhang distancematricesofsomegraphsrelatedtowheelgraphs AT chengyuansong distancematricesofsomegraphsrelatedtowheelgraphs |