Learn More
inv lve a journal of mathematics msp Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs An oriented graph is a simple digraph obtained from a simple graph by choosing exactly one of the two arcs (u, v) or (v, u) to replace each edge {u, v}. A simple digraph describes the zero-nonzero pattern of(More)
We have seen a patient with a profound, isolated, and quite selective deficit in proverb interpretation-aproverbia. The patient presented to us after an anoxic brain injury with aproverbia. Interestingly, the aproverbia appeared to be premorbid to the presenting event. Furthermore, the patient had no brain lesion that has been associated or even proposed as(More)
  • 1