Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5776747 | Discrete Mathematics | 2017 | 7 Pages |
Abstract
We develop an algorithm for computing the characteristic polynomial of matrices related to threshold graphs. We use this as tool to exhibit, for any natural number nâ¥4, 2nâ4 graphs with n vertices that have a non isomorphic pair with the same signless Laplacian spectrum. We also show how to construct infinite families of pairs of non isomorphic graphs having the same Q-spectrum.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
João Carvalho, Bruna S. Souza, Vilmar Trevisan, Fernando C. Tura,