A spectral faux tree with respect to a given matrix is a graph which is not a tree but
is cospectral with a tree for the given matrix. We consider the existence of spectral
faux trees for several matrices, with emphasis on constructions.
For the Laplacian matrix, there are no spectral faux trees. For the adjacency
matrix, almost all trees are cospectral with a faux tree. For the signless Laplacian
matrix, spectral faux trees can only exist when the number of vertices is of the
form
.
For the normalized adjacency, spectral faux trees exist when the number of vertices,
, is at
least 4, and we give an explicit construction for a family whose size grows exponentially
with
for
, where
is a fixed integer.
PDF Access Denied
We have not been able to recognize your IP address
18.97.9.172
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.