Construction of cospectral graphs
Combinatorics
2018-08-13 v1 Discrete Mathematics
Abstract
Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create non-isomorphic cospectral graphs by considering a graph as a clustered graph.
Cite
@article{arxiv.1808.03490,
title = {Construction of cospectral graphs},
author = {Supriyo Dutta and Bibhas Adhikari},
journal= {arXiv preprint arXiv:1808.03490},
year = {2018}
}