A double 2-(v,k,2λ) design is a design which is reducible into two 2-(v,k,λ) designs. It is called uniquely reducible if it has, up to equivalence, only one reduction. We present properties of uniquely reducible double designs which show that their total number can be determined if only the designs with non-trivial automorphisms are classified with respect to their automorphism group. As an app...

Erratum: Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361–371.

Let G = (V (G), E(G)) be a finite simple graph with p = |V (G)| vertices and q = |E(G)| edges,without isolated vertices or isolated edges. A vertexmagic total labeling is a bijection from V (G) ∪ E(G) to the consecutive integers 1, 2, . . . , p + q, with the property that, for every vertex u in V (G), one has f (u) +  uv∈E(G) f (uv) = k for some constant k. Such a labeling is called E-super ve...

Results: The mean Lysholm score improved from 45.6 (range, 11-76) to 71.9 (range, 30-91). The median preoperative Tegner activity scale score was 3 (range, 1-7), while the median postoperative score was 4 (range, 1-9). The median Western Ontario and McMaster Universities Arthritis Index (WOMAC) total score improved from 38 (range, 1-57) preoperatively to 6 postoperatively (range, 0-52). The mea...