On groups admitting a disconnected common divisor graph
Let \(G\) be an arbitrary group and \(A\) be a subgroup of \(G\). Accordingly with a paper by \textit{I. M. Isaacs} and \textit{C. E. Praeger} [ibid. 159, No. 1, 158-175 (1993; Zbl 0815.20002)], the common divisor graph \(\Gamma\) associated to the pair \((G,A)\) has as vertices the subdegrees of \((G,A)\), with an edge joining two vertices if and only if they are not coprime. There it was shown that \(\Gamma\) has at most two connected components. The paper under review gives structure theorems on the behaviour of \(G\) and \(A\) in both the connected and the disconnected case. Some examples are also provided.
- On the number of connected components of divisibility graph for certain simple groups
- On the conjugacy separability of certain graphs of groups
- On finite groups with disconnected prime graph.
- On \(G\)-graphs of certain finite groups
- Finite Groups with a Disconnectedp-Regular Conjugacy Class Graph
- Graphs and separability properties of groups
- Finite groups whose common-divisor graph is regular
- On group hypo-connected graphs
- Rational groups whose character degree graphs are disconnected
- On graphs related to conjugacy classes of groups
- Valencies and IP-graphs of association schemes
- Irreducible disconnected systems in groups
- The influence of conjugacy class sizes on the structure of finite groups: a survey.
- On Class Size of p-Singular Elements in Finite Groups
- On the common divisor graph of the product of integer multisets
- Permutation group subdegrees and the common divisor graph
- Schemes and the iP-graph
- On IP-graphs of association schemes and applications to group theory
This page was built for publication: On groups admitting a disconnected common divisor graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364306)