We introduce
-leaky positive
semidefinite forcing and the
-leaky
positive semidefinite number of a graph,
,
which combines the positive semidefinite color change rule with the addition
of leaks to the graph. Furthermore, we determine general properties of
and
for various graphs, including path graphs, complete graphs, wheel graphs,
complete bipartite graphs, trees, hypercubes, and prisms. We also define
-leaky
positive semidefinite forts with the purpose of unveiling differences between
-leaky standard
forcing and
-leaky
positive semidefinite forcing.
PDF Access Denied
We have not been able to recognize your IP address
216.73.216.120
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.