2 papers
math.CO2026
On the finite group whose proper enhanced power graph is claw-free
Sudip Bera, Andrea Lucchini
Let be a finite group. The \emph{enhanced power graph} of , denoted by , is the graph with vertex set in which two vertices and are adjacent if a…
math.CO2024
On the strong domination number of proper enhanced power graphs of finite groups
Sudip Bera
The enhanced power graph of a group G is a graph with vertex set G, where two distinct vertices x and y are adjacent if and only if there exists an element w in G such that both x…