4 papers · 1 filter
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…
Existence of a Non-Zero -Vector in the Row Space of Adjacency Matrices of Simple Graphs
Sudip Bera
We look for a non-zero -vector in the row space of the adjacency matrix of a graph provided has at least one edge. Akbari, Cameron, and Khosrovshahi conj…
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…