Introduction. Dedekind has determined all groups whose subgroups are all normal (see, e.g., [5, Theorem 12.5.4]). Partially generalizing this, Wielandt showed that a finite group is nilpotent, if and only if all its subgroups are subnormal, and also if and only if all maximal subgroups are normal [5, Corollary 10.3.1, 10.3.4]. Huppert [7, Sätze 23, 24] has shown that if all 2nd-maximal subgroup...

If M is the complement of a hyperplane arrangement, and A = H(M, k) is the cohomology ring of M over a field of characteristic 0, then the ranks, φk, of the lower central series quotients of π1(M) can be computed from the Betti numbers, bii = dimTor A i (k, k)i, of the linear strand in a minimal free resolution of k over A. We use the Cartan-Eilenberg change of rings spectral sequence to relate...

A edge 2-rainbow dominating function (E2RDF) of a graph G is a ‎function f from the edge set E(G) to the set of all subsets‎ ‎of the set {1,2} such that for any edge.......................

0

0

0

0

0

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...