Given a graph
,
the exponential distance matrix is defined entrywise by letting the
-entry be
, where
is the distance
between the vertices
and
with the convention that if vertices are in different components, then
. We
will establish several properties of the characteristic polynomial (spectrum) for this
matrix, give some families of graphs which are uniquely determined by their
spectrum, and produce cospectral constructions.
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.89
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.