The type-PQ adjacency polytope associated to a simple graph is a
-polytope
containing valuable information about an underlying power network. Chen and the
first author have recently demonstrated that, when the underlying graph
is
connected, the normalized volumes of the adjacency polytopes can be computed by
counting sequences of nonnegative integers satisfying certain restrictions determined
by
.
This article builds upon their work, namely by showing that one of
their main results — the so-called “triangle recurrence” — applies in
a more general setting. Formulas for the normalized volumes when
is obtained by deleting a path or a cycle from a complete graph are also
established.
PDF Access Denied
We have not been able to recognize your IP address
3.144.237.52
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.