Characterizing finite nilpotent groups associated with a graph theoretic equality (Q6964840)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8059004
Language Label Description Also known as
default for all languages
No label defined
    English
    Characterizing finite nilpotent groups associated with a graph theoretic equality
    scientific article; zbMATH DE number 8059004

      Statements

      Characterizing finite nilpotent groups associated with a graph theoretic equality (English)
      0 references
      0 references
      0 references
      0 references
      4 July 2025
      0 references
      The authors consider the \emph{power graph} \(\mathcal{P}(G)\) associated with a finite nilpotent group \(G\). The vertex set of \(\mathcal{P}(G)\) is \(G\) and there is an edge between \(x,y\in G\) if either \(x=y^k\) or \(x^{\ell}=y\) for some positive integers \(k\) and \(\ell\). Since \(G\) is finite, \(\mathcal{P}(G)\) is connected. Let \(\kappa(\mathcal{P}(G))\) denote the minimal number of vertices whose deletion yields a disconnected graph or the empty graph. Let \(\delta(\mathcal{P}(G))\) denote the minimal vertex degree of \(\mathcal{P}(G)\). Here, \(\kappa(\mathcal{P}(G))\leqslant \delta(\mathcal{P}(G))\).\N\NThe authors characterize the finite nilpotent groups \(G\) such that \(\kappa(\mathcal{P}(G))=\delta(\mathcal{P}(G))\). These groups belong to two general families:\N\begin{itemize}\N\item[1.] \(G\) is cyclic of order \(2^\epsilon q\), where \(\epsilon\in\{0,1\}\) and \(q\) is a power of a prime;\N\item[2.] \(G\) is non-cyclic of order \(2^sp^t\), where \(s\geqslant 2\) and \(t\geqslant 0\) are integers, such that \(G\) satisfies a property regarding either its Sylow \(2\)-subgroups or its Sylow \(p\)-subgroups.\N\end{itemize}
      0 references
      nilpotent group
      0 references
      power graph
      0 references
      vertex connectivity
      0 references
      minimum degree
      0 references

      Identifiers