<p>The power graph of a group <i>G</i> (denoted by <i>P</i>(<i>G</i>)) is the graph whose vertex set is <i>G</i> and two distinct vertices are adjacent if one is the power of the other. By removing the identity from a group’s power graph, <i>P</i>(<i>G</i>), one can obtain the group’s proper power graph. A graph is self-complementary if it is isomorphic to its complement. In this paper, we observe that if <i>G</i> is a <i>p</i>-group, then <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(P^*(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>P</mi> <mo>∗</mo> </msup> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is never self-complementary. For the case of an EPPO group <i>G</i>, <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(P^*(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>P</mi> <mo>∗</mo> </msup> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is not self-complementary. Moreover, we show that if <i>G</i> is a group having two or more distinct prime divisors, then there does not exist any finite group <i>G</i> except possibly <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq3.gif" Format="GIF" Height="26" Rendition="HTML" Resolution="72" Type="Linedraw" Width="110" /> </InlineMediaObject> <EquationSource Format="TEX">\(G\ncong C_{n}\rtimes C_{p_{k}^{\alpha _{k}}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>≇</mo> <msub> <mi>C</mi> <mi>n</mi> </msub> <mo>⋊</mo> <msub> <mi>C</mi> <msubsup> <mi>p</mi> <mrow> <mi>k</mi> </mrow> <msub> <mi>α</mi> <mi>k</mi> </msub> </msubsup> </msub> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(p_{k} \not \mid n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>p</mi> <mi>k</mi> </msub> <mo>∤</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="67" /> </InlineMediaObject> <EquationSource Format="TEX">\(C_{n}\rtimes Q_{2^r}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>C</mi> <mi>n</mi> </msub> <mo>⋊</mo> <msub> <mi>Q</mi> <msup> <mn>2</mn> <mi>r</mi> </msup> </msub> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\(2\not \mid n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mo>∤</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq7.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="28" /> </InlineMediaObject> <EquationSource Format="TEX">\(Q_{2^r}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>Q</mi> <msup> <mn>2</mn> <mi>r</mi> </msup> </msub> </math></EquationSource> </InlineEquation> is the generalized quarternion group such that its proper power graph is self-complementary. The self-complementary index of a graph <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq8.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Gamma \)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="normal">Γ</mi> </math></EquationSource> </InlineEquation>, denoted by <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq9.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="32" /> </InlineMediaObject> <EquationSource Format="TEX">\(s(\Gamma )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>s</mi> <mo stretchy="false">(</mo> <mi mathvariant="normal">Γ</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, is a graph parameter that measures the closeness of a graph to being self-complementary. In this paper, we provide suitable sharp bounds (upper and lower) for the self-complementary index of <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="13226_2025_751_Article_IEq10.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(P^*(G)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>P</mi> <mo>∗</mo> </msup> <mrow> <mo stretchy="false">(</mo> <mi>G</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. Besides that, we look into the finite groups whose power graphs are self-complementary in the sense of different types of forbidden subgraphs and graph theory properties such as regularity, unicyclicity, 2-connectedness, strongly regularity, etc.</p>

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

On the self-complementary power graph of finite groups

  • Pallabi Manna,
  • Ranjit Mehatari

摘要

The power graph of a group G (denoted by P(G)) is the graph whose vertex set is G and two distinct vertices are adjacent if one is the power of the other. By removing the identity from a group’s power graph, P(G), one can obtain the group’s proper power graph. A graph is self-complementary if it is isomorphic to its complement. In this paper, we observe that if G is a p-group, then \(P^*(G)\) P ( G ) is never self-complementary. For the case of an EPPO group G, \(P^*(G)\) P ( G ) is not self-complementary. Moreover, we show that if G is a group having two or more distinct prime divisors, then there does not exist any finite group G except possibly \(G\ncong C_{n}\rtimes C_{p_{k}^{\alpha _{k}}}\) G C n C p k α k with \(p_{k} \not \mid n\) p k n and \(C_{n}\rtimes Q_{2^r}\) C n Q 2 r with \(2\not \mid n\) 2 n and \(Q_{2^r}\) Q 2 r is the generalized quarternion group such that its proper power graph is self-complementary. The self-complementary index of a graph \(\Gamma \) Γ , denoted by \(s(\Gamma )\) s ( Γ ) , is a graph parameter that measures the closeness of a graph to being self-complementary. In this paper, we provide suitable sharp bounds (upper and lower) for the self-complementary index of \(P^*(G)\) P ( G ) . Besides that, we look into the finite groups whose power graphs are self-complementary in the sense of different types of forbidden subgraphs and graph theory properties such as regularity, unicyclicity, 2-connectedness, strongly regularity, etc.