Simone de Beauvoir’s Th e Second Sex was translated into Czech in 1966, the fi rst translation of the book to be published in a socialist state. It was, like many other translations during this period, a compilation of selections and was edited by the phenomenologist Jan Patočka who, in his postscript, presented the work primarily within its philosophical context. Th e book, which was published in three editions within two years and reached a combined print run of almost one hundred thousand copies, reaped substantial acclaim both among the lay and the academic public. Th e main debate about the book unfolded in the magazines Literární noviny and Vlasta, in which the contributors aired their views on the book from various positions – as advocates of phenomenology, Marxism, and the women’s press. In order to make the main arguments of the Czech debate on Th e Second Sex accessible to our readers, we are publishing here Ashley Davies’s English translation of the contributions by Jan Patočka, Ivan Sviták, and Irena Dubská.
For a vertex v of a connected oriented graph D and an ordered set W = [wi, w2,.. •, wk} of vertices of D, Ihe (directed distcince) representation of v with respect to W is the ordered fc-tuple r(v \ W) = (d(v, w1),d(v, w2 ), •.. ,d(v, wk )), where d(v, wi ) is Ihe directed distance from v to wi . The set W is a resolving set for D if every two distinct vertices of D have distinct representations. The minimum cardinality of a resolving set for D is the (directed distance) dimension dhn(D) of D. The dimension of a connected oriented graph need not be defined. Those oriented graphs with dimension 1 are characterized. We discuss the problem of determining the largest dimension of an oriented graph with a fixed order. It is shown that if the outdegree of every vertex of a connected oriented graph D of order n is at least 2 and dim(D) is defined, then dim(D) ≤ n - 3 and this bound is sharp.
The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread, several upper bounds of the Nordhaus-Gaddum type of Laplacian eigenvalues are improved. Some operations on Laplacian spread are presented. Connected $c$-cyclic graphs with $n$ vertices and Laplacian spread $n-1$ are discussed.