1 citations · 1 across the 8 of their papers we have counts for
11 papers
On finite groups whose power graphs satisfy certain connectivity conditions
Ramesh Prasad Panda
Consider a graph . A set of vertices in is called a {cyclic vertex cutset} of if is disconnected and has at least two components containing cycles. If h…
Characterizing finite groups whose order supergraphs satisfy a connectivity condition
Ramesh Prasad Panda, Papi Ray
Let be an undirected and simple graph. A set of vertices in is called a {cyclic vertex cutset} of if is disconnected and has at least two components each c…
Characterizations of -groups whose power graphs satisfy certain connectivity conditions
Ramesh Prasad Panda
Let be an undirected and simple graph. A set of vertices in is called a {cyclic vertex cutset} of if is disconnected and has at least two components contai…
On the Difference Graph of power graphs of finite groups
Parveen, Jitender Kumar, Ramesh Prasad Panda
The power graph of a finite group is a simple undirected graph with vertex set and two vertices are adjacent if one is a power of the other. The enhanced power graph of a f…
On the minimum degree of power graphs of finite nilpotent groups
Ramesh Prasad Panda, Kamal Lochan Patra, Binod Kumar Sahoo
The power graph of a group is the simple graph with vertex set and two vertices are adjacent whenever one of them is a positive power of the other. In this…
Characterizing finite nilpotent groups associated with a graph theoretic equality
Ramesh Prasad Panda, Kamal Lochan Patra, Binod Kumar Sahoo
The power graph of a group is the simple graph whose vertices are the group elements and two vertices are adjacent whenever one of them is a positive power of the other. We charact…
On the enhanced power graph of a group
Ramesh Prasad Panda, Sandeep dalal, Jitender Kumar
The enhanced power graph of a group is a graph with vertex set and two vertices are adjacent if they belong to the same cyclic subgroup. In this paper, w…
On the minimum degree of the power graph of a finite cyclic group
Ramesh Prasad Panda, Kamal Lochan Patra, Binod Kumar Sahoo
The power graph of a finite group is the simple undirected graph whose vertex set is , in which two distinct vertices are adjacent if one of them is an inte…
A combinatorial characterization of finite groups of prime exponent
Ramesh Prasad Panda
The power graph of a group is a simple and undirected graph with vertex set and two distinct vertices are adjacent if one is a power of the other. In this article, we chara…
Laplacian spectra of power graphs of certain finite groups
Ramesh Prasad Panda
In this article, various aspects of Laplacian spectra of power graphs of finite cyclic, dicyclic and finite -groups are studied. Algebraic connectivity of power graphs of the ab…
On connectedness of power graphs of finite groups
Ramesh Prasad Panda, K. V. Krishna
The power graph of a group is the graph whose vertex set is and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separ…