‎in 1970‎, ‎menegazzo [gruppi nei quali ogni sottogruppo e intersezione di sottogruppi massimali‎, ‎ atti accad‎. ‎naz‎. ‎lincei rend‎. ‎cl‎. ‎sci‎. ‎fis‎. ‎mat‎. ‎natur. 48 (1970)‎, ‎559--562.] gave a complete description of the structure of soluble $im$-groups‎, ‎i.e.‎, ‎groups in which every subgroup can be obtained as intersection of maximal subgroups‎. ‎a group $g$ is said to have the $fm$...

Let $R$ be a commutative ring with identity and $M$ be an unitary $R$-module. The intersection graph of an $R$-module $M$, denoted by $Gamma(M)$, is a simple graph whose vertices are all non-trivial submodules of $M$ and two distinct vertices $N_1$ and $N_2$ are adjacent if and only if $N_1cap N_2neq 0$. In this article, we investigate the concept of a planar intersection graph and maximal subm...

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

abstract. in this paper we study some relations between the power andquotient power graph of a finite group. these interesting relations motivateus to find some graph theoretical properties of the quotient power graphand the proper quotient power graph of a finite group g. in addition, weclassify those groups whose quotient (proper quotient) power graphs areisomorphic to trees or paths.

A proper non-empty subset C of the points of a linear space S = (P; L) is called line-closed if any two intersecting lines of S , each meeting C at least twice, have their intersection in C. We show that when every line has k points and every point lies on r lines the maximum size for such sets is r + k ? 2. In addition it is shown that this cannot happen for projective spaces PG(n; q) unless q...

The directed power graph G?(G) of a group G is the simple digraph with vertex set such that x?y if y x. G, denoted by G(G), underlying graph. In this paper, for groups and H, following proved. If has no quasicyclic subgroup Cp? which trivial intersection every cyclic K K??Cp?, then G(G)?G(H) implies G?(G)?G?(H). particular, any two torsion-free having isomorphic graphs have graphs.

The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...

Let H,K be subgroups of G. We investigate the intersection properties of left and right cosets of these subgroups. If H and K are subgroups of G, then G can be partitioned as the disjoint union of all left cosets of H, as well as the disjoint union of all right cosets of K. But how do these two partitions of G intersect each other? Definition 1. Let G be a group, and H a subgroup of G. A left t...