Results 121 to 130 of about 104,321 (158)
Secure Edge Offloading Strategy for IoT-Enabled Electromagnetic Sensing Systems. [PDF]
Sensors (Basel)Xue T, Xia Y, Chen X.
europepmc +1 more source
Learning the reaction coordinate: collective variables from physical intuition to generative models.
Digit DiscovTalmazan RA +5 more
europepmc +1 more source
On the Connectivity of Enhanced Power Graphs of Finite Groups
Graphs and Combinatorics, 2021 This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G is 1. We derive an upper bound of vertex connectivity for the enhanced power graph of any general abelian group G.
Sudip Bera
exaly +5 more sources
On the difference of the enhanced power graph and the power graph of a finite group
Journal of Combinatorial Theory - Series AzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angsuman Das +2 more
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the proper enhanced power graphs of finite nilpotent groups
Journal of Group Theory, 2022Abstract For a group 𝐺, the enhanced power graph of 𝐺 is a graph with vertex set 𝐺 in which two distinct vertices x , y
Sudip Bera
exaly +3 more sources
On enhanced power graphs of certain groups
Discrete Mathematics, Algorithms and Applications, 2020The enhanced power graph [Formula: see text] of a group [Formula: see text] is a simple undirected graph with vertex set [Formula: see text] and two distinct vertices [Formula: see text] are adjacent if both [Formula: see text] and [Formula: see text] belongs to same cyclic subgroup of [Formula: see text].
Sandeep Dalal, Jitender Kumar
openaire +1 more source
Certain properties of the enhanced power graph associated with a finite group
Acta Mathematica Hungarica, 2023 The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this article, we determine all finite groups such that the minimum degree and the vertex connectivity of $\mathcal{P}_E(
Kumar, J., Ma, X., Parveen, Singh, S.
exaly +4 more sources
On the enhanced power graph of a finite group
Communications in Algebra, 2020The enhanced power graph Pe(G) of a group G is a graph with vertex set G and two vertices are adjacent if they belong to the same cyclic subgroup.
Ramesh Prasad Panda +2 more
openaire +1 more source