<p>Let <i>G</i> be a finite group. The generating graph of subgroups of <i>G</i>, denoted by <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="25_2025_2414_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma (G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Γ</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, is a graph whose vertices are non-trivial proper subgroups of <i>G</i> and two distinct vertices <i>H</i> and <i>K</i> are adjacent if and only if <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="25_2025_2414_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="91" /> </InlineMediaObject> <EquationSource Format="TEX">\(G=\langle H, K\rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>=</mo> <mo stretchy="false">⟨</mo> <mi>H</mi> <mo>,</mo> <mi>K</mi> <mo stretchy="false">⟩</mo> </mrow> </math></EquationSource> </InlineEquation>. In this paper, we obtain some sufficient and necessary conditions for <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="25_2025_2414_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma (G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Γ</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> being planar when it is connected, and characterize the structure of the finite group <i>G</i> where <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="25_2025_2414_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma (G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Γ</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> has a universal vertex. We define a new graph <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="25_2025_2414_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma ^{*}(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mmultiscripts> <mi mathvariant="normal">Γ</mi> <mrow /> <mrow> <mrow /> <mo>∗</mo> </mrow> </mmultiscripts> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, which is obtained by removing isolated vertices from <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="25_2025_2414_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="37" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma (G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="normal">Γ</mi> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. We also characterize finite groups <i>G</i> when <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="25_2025_2414_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma ^{*}(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mmultiscripts> <mi mathvariant="normal">Γ</mi> <mrow /> <mrow> <mrow /> <mo>∗</mo> </mrow> </mmultiscripts> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is a star graph, a complete graph, a complete <i>k</i>-partite graph, or has a universal vertex.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On the Generating Graph in a Finite Group II

  • Jiakuan Lu,
  • Wei Meng,
  • Xueqing Qin,
  • Fang Wei,
  • Boru Zhang

摘要

Let G be a finite group. The generating graph of subgroups of G, denoted by \(\Gamma (G)\) Γ ( G ) , is a graph whose vertices are non-trivial proper subgroups of G and two distinct vertices H and K are adjacent if and only if \(G=\langle H, K\rangle \) G = H , K . In this paper, we obtain some sufficient and necessary conditions for \(\Gamma (G)\) Γ ( G ) being planar when it is connected, and characterize the structure of the finite group G where \(\Gamma (G)\) Γ ( G ) has a universal vertex. We define a new graph \(\Gamma ^{*}(G)\) Γ ( G ) , which is obtained by removing isolated vertices from \(\Gamma (G)\) Γ ( G ) . We also characterize finite groups G when \(\Gamma ^{*}(G)\) Γ ( G ) is a star graph, a complete graph, a complete k-partite graph, or has a universal vertex.