Abstract
Let be an even integer and be the wheel graph with vertices. The distance between any two distinct vertices and of is the length of the shortest path connecting and . Let be the symmetric matrix with diagonal entries equal to zero and off-diagonal entries equal to . In this paper, we find a positive semidefinite matrix such that , all row sums of equal to zero and a rank one matrix such that An interlacing property between the eigenvalues of and is also proved.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.