论文标题
有限群体的非$ \ $ \ mathfrak f $ -graph
The non-$\mathfrak F$-graph of a finite group
论文作者
论文摘要
给定一个编队$ \ mathfrak f $，我们考虑了其顶点是$ g $的元素，而两个顶点$ g，h \ in g $ in g $当时且仅当$ \ langle g，h \ rangle \ rangle \ notin \ notin \ notin \ mathfrak f $相邻。我们对以下两个问题感兴趣。该图的隔离顶点的集合是$ g $的子组吗？是否通过删除孤立的顶点获得连接的图来获得子图？
Given a formation $\mathfrak F$, we consider the graph whose vertices are the elements of $G$ and where two vertices $g,h\in G$ are adjacent if and only if $\langle g,h \rangle \notin\mathfrak F$. We are interested in the two following questions. Is the set of the isolated vertices of this graph a subgroup of $G$? Is the subgraph obtained by deleting the isolated vertices a connected graph?
