This review traces, through psychiatric textbooks, the history of the Kraepelinian concept of paranoia in the 20th century and then relates the common reported symptoms and signs to the diagnostic criteria for paranoia/delusional disorder in DSM-III through DSM-5. Clinical descriptions of paranoia appearing in 10 textbooks, published 1899 to 1970, revealed 11 prominent symptoms and signs report...

‎‎in the category of mordell curves (e_d:y^2=x^3+d) with nontrivial torsion groups we find curves of the generic rank two as quadratic twists of (e_1), ‎and of the generic rank at least two and at least three as cubic twists of (e_1). ‎previous work‎, ‎in the category of mordell curves with trivial torsion groups‎, ‎has found infinitely many elliptic curves with rank at least seven as sextic tw...

Graphs and Digraphs: A graph G = (V,E) is a structure that represents a discrete set V objects, called vertices or nodes, and a set of pairwise relations E between these objects, called edges. Edges may be directed from one vertex to another or may be undirected. The term “graph” means an undirected graph, and directed graphs are often called digraphs (see Fig. 1). Graphs and digraphs provide a...

We call a subgraph of an edge-colored graph rainbow, if all its edges have different colors. The anti-Ramsey number G in complete K n , denoted by r ( ) is the maximum colors edge-coloring with no rainbow copy . In this paper, we determine exact value for star forests and double stars approximate linear forests.

R. J. Faudree DEPARTMENT OF MATHEMATICAL SCIENCES MEMPHIS STATE UNIVERSITY MEMPHIS, TENNESSEE A. Gyarfas COMPUTER AND AUTOMATION INSTITUTE HUNGARIAN ACADEMY OF SCIENCES BUDAPEST, HUNGARY L. Lesniak DEPARTMENT OF MATH AND COMPUTER SCIENCE DREW UNIVERSITY MADISON, NEW JERSEY R. H. Schelp DEPARTMENT OF MATHEMATICAL SCIENCES MEMPHIS STATE UNIVERSITY MEMPHIS, TENNESSEE We prove that for d ~ 4, d * 5...

An edge-colored hypergraph is rainbow if all of its edges have different colors. Given two hypergraphs H and G , the anti-Ramsey number a r ( ) in maximum colors coloring so that there does not exist copy . Li et al. determined k -matchings complete bipartite graphs. Jin Zang showed uniqueness extremal coloring. In this paper, as generalization these results, we determine K n 1 … M -partite -un...