Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646851 | Discrete Mathematics | 2015 | 9 Pages |
Abstract
The distance eigenvalues of a connected graph GG are the eigenvalues of its distance matrix DD, and they form the distance spectrum of GG. A graph is called distance integral if its distance spectrum consists entirely of integers. We show that no nontrivial tree can be distance integral. We characterize distance integral graphs in the classes of graphs similar to complete split graphs, which, together with relations between graph operations and distance spectra, allows us to exhibit many infinite families of distance integral graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Milan Pokorný, Pavel Híc, Dragan Stevanović, Marko Milošević,