On the Walks and Bipartite Double Coverings of Graphs with the same Main Eigenspace

preprint2019arXivOpen access

Abstract

The main eigenvalues of a graph GG are those eigenvalues of the (0,1)(0,1)-adjacency matrix A\mathbf A having a corresponding eigenvector not orthogonal to j=(1,…,1)\mathbf j = (1,\dots,1). The CDC of a graph GG is the direct product G×K2G\times K_2. The main eigenspace of A\mathbf A is generated by the principal main eigenvectors and is the same as the image of the walk matrix. A hierarchy of properties of pairs of graphs is established in view of their CDC's, walk matrices, main eigenvalues, eigenvectors and eigenspaces. We determine by algorithm that there are 32 pairs of non-isomorphic graphs on at most 8 vertices which have the same CDC.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.