On the eigenvalues of distance powers of circuits

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages

Scientific paper

10.1016/j.laa.2010.01.012

Taking the d-th distance power of a graph, one adds edges between all pairs of vertices of that graph whose distance is at most d. It is shown that only the numbers -3, -2, -1, 0, 1, 2d can be integer eigenvalues of a circuit distance power. Moreover, their respective multiplicities are determined and explicit constructions for corresponding eigenspace bases containing only vectors with entries -1, 0, 1 are given.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the eigenvalues of distance powers of circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the eigenvalues of distance powers of circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the eigenvalues of distance powers of circuits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-227448

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.