activity
20112023
most citedAffine Near-Semirings over Brandt Semigroups

12 citations · 27 across the 17 of their papers we have counts for

collaborators

18 papers

cs.DM2023

Words for the Graphs with Permutation-Representation Number at most Three

Khyodeno Mozhui, K. V. Krishna

The graphs with permutation-representation number (\textit{prn}) at most two are known. While a characterization for the class of graphs with the \textit{prn} at most three is an o…

cs.DM2021

On the Representation Number of Bipartite Graphs

Khyodeno Mozhui, K. V. Krishna

A word-representable graph is a simple graph which can be represented by a word over the vertices of such that any two vertices are adjacent in if and only if they…

cs.LO2018

On the structure of C-algebras through atomicity and if-then-else

Gayatri Panicker, K. V. Krishna, Purandar Bhaduri

This paper introduces the notions of atoms and atomicity in -algebras and obtains a characterisation of atoms in the -algebra of transformations. Further, this work presents…

math.CO2017

On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups

Ramesh Prasad Panda, K. V. Krishna

The power graph of a group is the graph whose vertex set is and two distinct vertices are adjacent if one is a power of the other. In this paper, the minimum degree of powe…

math.CO2017★ 1 cited

On connectedness of power graphs of finite groups

Ramesh Prasad Panda, K. V. Krishna

The power graph of a group is the graph whose vertex set is and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separ…

cs.LO2017

Axiomatization of if-then-else over monoids of possibly non-halting programs and tests

Gayatri Panicker, K. V. Krishna, Purandar Bhaduri

In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, the notion of -sets was introduced in the literature by consider…