activity
20152024
most citedOn some characterizations of strong power graphs of finite groups

3 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing math.COShow all

8 papers · 1 filter

math.CO2021

On connectivity, domination number and spectral radius of the proper enhanced power graphs of finite nilpotent groups

Sudip Bera, Hiranya Kishore Dey

For a group the enhanced power graph of is a graph with vertex set in which two distinct elements are adjacent if and only if there exists an element in

math.CO2020

Combinatorialization of Sury and McLaughlin identities, general linear recurrences in a unified approach

Sudip Bera

In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant c…

math.CO2020

On the connectivity of enhanced power graph of finite group

Sudip Bera, Hiranya Kishore Dey, Sajal Kumar Mukherjee

This paper deals with the vertex connectivity of enhanced power graph of finite group. We classify all abelian groups G such that vertex connectivity of enhanced power graph of G i…

math.CO2020

Generalized power sum and Newton-Girard identities

Sudip Bera, Sajal Kumar Mukherjee

In this article we prove an algebraic identity which significantly generalizes the formula for sum of powers of consecutive integers involving Stirling numbers of the second kind.…

math.CO2019

enumeration of weighted paths on a digraph and block hook determinant

Sudip Bera

In this article, we evaluate determinants of block hook matrices, which are block matrices consist of hook matrices. In particular, we deduce that the determinant of a block hook m…

math.CO2018

Combinatorial proofs of the Newton-Girard and Chapman-Costas-Santos identities

Sajal Kumar Mukherjee, Sudip Bera

In this paper we give combinatorial proofs of some well known identities and obtain some generalizations. We give a visual proof of a result of Chapman and Costas-Santos regarding…