The following pages link to Sudip Bera (Q245746):
Displaying 15 items.
- Enumeration of weighted paths on a digraph and block hook determinant (Q825568) (← links)
- A simple elementary proof of ``the unimodularity theorem'' of Oliver Knill (Q1747896) (← links)
- Combinatorial proofs of the Newton-Girard and Chapman-Costas-Santos identities (Q1999725) (← links)
- On the proper enhanced power graphs of finite nilpotent groups (Q2093232) (← links)
- Generalized power sum and Newton-Girard identities (Q2657062) (← links)
- On the connectivity of enhanced power graphs of finite groups (Q2657108) (← links)
- On enhanced power graphs of finite groups (Q3177310) (← links)
- Combinatorial proofs of some determinantal identities (Q4567773) (← links)
- Normal subgroup based power graphs of a finite group (Q4978385) (← links)
- On the intersection power graph of a finite group (Q5009978) (← links)
- Combinatorialization of Sury and McLaughlin identities and general linear recurrences by a unified approach (Q5093420) (← links)
- Line graph characterization of power graphs of finite nilpotent groups (Q5097404) (← links)
- On some characterizations of strong power graphs of finite groups (Q5962819) (← links)
- A Matrix for Counting Paths in Acyclic Colored Digraphs (Q6489360) (← links)
- An exact enumeration of vertex connectivity of the enhanced power graphs of finite nilpotent groups (Q6532946) (← links)
