Constructing Non-isomorphic Signless Laplacian Cospectral Graphs
Combinatorics
2018-08-14 v1 Discrete Mathematics
Abstract
In this article, we generate large families of non-isomorphic and signless Lalacian cospectral graphs using partial transpose on graphs. Our constructions are significantly powerful. More than of non-isomorphic signless-Laplacian cospectral graphs can be generated with partial transpose when number of vertices is . We have also produced numerous examples of non-isomorphic signless Laplacian cospectral graphs.
Keywords
Cite
@article{arxiv.1808.04054,
title = {Constructing Non-isomorphic Signless Laplacian Cospectral Graphs},
author = {Supriyo Dutta},
journal= {arXiv preprint arXiv:1808.04054},
year = {2018}
}