7 citations · 17 across the 14 of their papers we have counts for
17 papers
On graphs with equal domination and total domination numbers
Sudip Bera
For a graph without isolated vertices, . While graphs attaining have been studied extensively, a complete structural description in the sm…
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…
On the difference of the intersection power graph and the power graph of a finite group
Sudip Bera, Peter J. Cameron
The difference graph D(G) of a finite group G is the graph obtained by taking the (edge) difference of the intersection power graph and the power graph of G, and subsequently remov…
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…
An exact enumeration of vertex connectivity of the enhanced power graphs of finite nilpotent groups
Sudip Bera, Hiranya Kishore Dey
The enhanced power graph of a group is a graph with vertex set where two distinct vertices and are adjacent if and only if there exists an element in such…
A matrix for counting paths in acyclic colored digraphs
Sudip Bera
In this paper, we introduce a matrix associate with a -colored acyclic digraph such that enumerates the paths in the digraph…