http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
FINITE GROUPS WHOSE INTERSECTION GRAPHS ARE PLANAR
Selcuk Kayacan,Ergun Yaraneri 대한수학회 2015 대한수학회지 Vol.52 No.1
The intersection graph of a group G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of G, and there is an edge between two distinct vertices H and K if and only if H∩K ≠ 1 where 1 denotes the trivial subgroup of G. In this paper we characterize all finite groups whose intersection graphs are planar. Our methods are elementary. Among the graphs similar to the intersection graphs, we may count the subgroup lattice and the subgroup graph of a group, each of whose planarity was already considered before in [2, 10, 11, 12].
FINITE GROUPS WHOSE INTERSECTION GRAPHS ARE PLANAR
Kayacan, Selcuk,Yaraneri, Ergun Korean Mathematical Society 2015 대한수학회지 Vol.52 No.1
The intersection graph of a group G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of G, and there is an edge between two distinct vertices H and K if and only if $H{\cap}K{\neq}1$ where 1 denotes the trivial subgroup of G. In this paper we characterize all finite groups whose intersection graphs are planar. Our methods are elementary. Among the graphs similar to the intersection graphs, we may count the subgroup lattice and the subgroup graph of a group, each of whose planarity was already considered before in [2, 10, 11, 12].