Person: Bera, Sudip
Loading...
Name
Sudip Bera
Job Title
Faculty
Email Address
Telephone
079-68261632
Birth Date
Specialization
Algebraic graph theory, Algebraic combinatorics
Abstract
Biography
I am an Assistant Professor from 02nd�January, 2023-Present in the Department of Mathematics, DA-IICT, Gandhinagar, Gujrat India. Earlier, I was a Postdoctoral fellow in Mathematics at Harish-Chandra Research Institute from 16th�September, 2022 to 31st�December, 2022. Before that, I was a Visiting fellow in Mathematics at TIFR Mumbai from 2nd�August, 2022 to 15th�September, 2022. My mentor was Prof. Amitava Bhattacharya. Before that, I was a Postdoctoral fellow in Mathematics at IISc, Bangalore from 1st�July, 2019 to 30th�June, 2022. My mentor was Prof. Arvind Ayyer. I finished my Ph.D in Visva-Bharati University. I defended my Ph.D. thesis in June, 2019.
Research Projects
Organizational Units
Name
5 results
Search Results
Now showing 1 - 5 of 5
Publication Metadata only On the strong domination number of proper enhanced power graphs of finite groups(Springer) Bera, Sudip; DA-IICT, GandhinagarThe enhanced power graph of a group�G�is a graph with vertex set�G, where two distinct vertices�??�and�??�are adjacent if and only if there exists an element�??�in�G�such that both�??�and�??�are powers of�??. To obtain the proper enhanced power graph, we consider the induced subgraph on the set�, where�D�represents the set of dominating vertices in the enhanced power graph. In this paper, we aim to determine the strong domination number of the proper enhanced power graphs of finite nilpotent groups.Publication Metadata only On the domination number of proper power graphs of finite groups(Elsevier, 01-10-2025) Bera, Sudip; Dey, Hiranya Kishore; Patra, Kamal Lochan; Sahoo, Binod Kumar; DA-IICT, GandhinagarPublication Metadata only An exact enumeration of vertex connectivity of the enhanced power graphs of finite nilpotent groups(Springer, 01-05-2025) Bera, Sudip; Dey, H K; DA-IICT, GandhinagarPublication Metadata only Existence of a Non-Zero (0, 1)-Vector in the Row Space of Adjacency Matrices of Simple Graphs(Springer, 24-02-2025) Bera, Sudip; DA-IICT, GandhinagarPublication Metadata only A Matrix for Counting Paths in Acyclic Colored Digraphs(Springer, 08-04-2024) Bera, Sudip; DA-IICT, GandhinagarIn this paper, we generalize a theorem of R. P. Stanley regarding the enumeration of paths in acyclic digraphs.