Ramesh Prasad Panda

collaborators

2 papers

math.CO2025

Characterizing finite groups whose order supergraphs satisfy a connectivity condition

Ramesh Prasad Panda, Papi Ray

Let $I^$ be an undirected and simple graph. A set $S$ of vertices in $I^$ is called a {cyclic vertex cutset} of $I^$ if $I^ - S$ is disconnected and has at least two components ea…

math.CO2025

On finite groups whose power graphs satisfy certain connectivity conditions

Ramesh Prasad Panda

Consider a graph $I^$ . A set $S$ of vertices in $I^$ is called a {cyclic vertex cutset} of $I^$ if $I^ - S$ is disconnected and has at least two components containing cycles. If $…