activity
20102026
most citedVertex connectivity of the power graph of a finite cyclic group

19 citations · 23 across the 20 of their papers we have counts for

collaborators

23 papers

math.OC2026

On Completely Positive and Semidefinite Programs for Moment Bounds on Maximum of Random Quadratics

Buse Unluturk, Divya Padmanabhan, Karthik Natarajan

Completely positive programs are known to provide an exact representation to several NP-hard optimization problems. In this work, we look at the maximum of random quadratic functio…

math.CO2026

Spectral gap of the normalized distance Laplacian

Hitesh Kumar, Kamal Lochan Patra

The smallest positive eigenvalue of the normalized distance Laplacian matrix of a connected graph is called its \emph{spectral gap} and is…

math.CO2026

On the distances between the core center and other central parts of a tree

Akash De, Kamal Lochan Patra

Let be a tree. For a vertex , the eccentric subtree number is defined as where denotes the number of subtree…

math.GR2025

On the deep commuting graph of a finite group

Sumana Hatui, Sanjay Mukherjee, Kamal Lochan Patra

Let be a finite group and let be a Schur cover of . The deep commuting graph of is a simple graph with vertex set , where two distinct vertices a…

math.CO2025

On the minimum cut-sets of the power graph of a finite cyclic group, II

Sanjay Mukherjee, Kamal Lochan Patra, Binod Kumar Sahoo

The power graph of a finite group is the simple graph with vertex set and two distinct vertices are adjacent if one of them is a power of the other. Let $n…

math.GR2022

On the super graphs and reduced super graphs of some finite groups

Sandeep Dalal, Sanjay Mukherjee, Kamal Lochan Patra

For a finite group , let be an equivalence (equality, conjugacy or order) relation on and let be a (power, enhanced power or commuting) graph with vertex set . Th…

math.CO2022★ 1 cited

On the minimum cut-sets of the power graph of a finite cyclic group

Sanjay Mukherjee, Kamal Lochan Patra, Binod Kumar Sahoo

The power graph of a finite group is the simple graph with vertex set , in which two distinct vertices are adjacent if one of them is a power of the other.…

math.CO2021

Some new central parts of connected graphs

Dinesh Pandey, Kamal Lochan Patra

The center, median and the security center are three central parts defined for any connected graph whereas the characteristic set, subtree core and core vertices are three central…

math.CO2021

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…

math.GR2021

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…

math.CO2020

Total eccentricity index of graphs with fixed number of pendant or cut vertices

Dinesh Pandey, Kamal Lochan Patra

The total eccentricity index of a connected graph is defined as sum of the eccentricities of all its vertices. We denote the set of all connected graphs on vertices with pe…

math.CO2020

A conjecture on different central parts of binary trees

Dinesh Pandey, Kamal Lochan Patra

Let be the family of binary trees on vertices obtained by identifying the root of an rgood binary tree with a vertex of maximum eccentricity of a binary caterpillar. In t…

math.CO2020★ 1 cited

Proper divisor graph of a positive integer

Hitesh Kumar, Kamal Lochan Patra, Binod Kumar Sahoo

The proper divisor graph of a positive integer is the simple graph whose vertices are the proper divisors of , and in which two distinct vertices are adjacent i…

math.CO2019

Wiener index of graphs with fixed number of pendant or cut vertices

Dinesh Pandey, Kamal Lochan Patra

The Wiener index of a connected graph is defined as the sum of the distances between all unordered pair of its vertices. In this paper, we characterize the graphs which extremize t…

math.CO2019

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…

math.SP2019

Laplacian eigenvalues of the zero divisor graph of the ring

Sriparna Chattopadhyay, Kamal Lochan Patra, Binod Kumar Sahoo

We study the Laplacian eigenvalues of the zero divisor graph of the ring and prove that is Laplacia…

math.CO2018★ 2 cited

The core index of a graph

Dinesh Pandey, Kamal Lochan Patra

For a graph we denote the number of connected subgraphs of by . For a tree , has been studied extensively and it has been observed that has a revers…

math.CO2018

Vertex connectivity of the power graph of a finite cyclic group II

Sriparna Chattopadhyay, Kamal Lochan Patra, Binod Kumar Sahoo

The power graph of a given finite group is the simple undirected graph whose vertices are the elements of , in which two distinct vertices are adjacent if a…

math.CO2018

Minimal cut-sets in the power graphs of certain finite non-cyclic groups

Sriparna Chattopadhyay, Kamal Lochan Patra, Binod Kumar Sahoo

The power graph of a group is the simple graph with vertices as the group elements, in which two distinct vertices are adjacent if and only if one of them can be obtained as an int…

math.CO2017★ 19 cited

Vertex connectivity of the power graph of a finite cyclic group

Sriparna Chattopadhyay, Kamal Lochan Patra, Binod Kumar Sahoo

Let , where are positive integers and are distinct prime numbers with . For the…

math.CO2016

Center, centroid and subtree core of trees

Dheer Noal Sunil Desai, Kamal Lochan Patra

For and consider the tree on vertices which is obtained by adding pendant vertices to one degree vertex of the path .…

math.CO2010

Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth

Kamal Lochan Patra, Binod Kumar Sahoo

In this paper we consider the following problem: Over the class of all simple connected unicyclic graphs on vertices with girth ( being fixed), which graph minimizes t…

math.CO2010

Algebraic connectivity of connected graphs with fixed number of pendant vertices

Arbind K. Lal, Kamal L. Patra, Binod K. Sahoo

In this paper we consider the following problem: Over the class of all simple connected graphs of order with pendant vertices ( being fixed), which graph maximizes (re…