activity
20112022
most citedNon-Zero Component Graph of a Finite Dimensional Vector Space

61 citations · 202 across the 12 of their papers we have counts for

collaborators

13 papers

math.CO2022★ 7 cited

On Difference of Enhanced Power Graph and Power Graph of a Finite Group

Sucharita Biswas, Peter J. Cameron, Angsuman Das +1

The difference graph of a finite group is the difference of enhanced power graph of and power graph of , with all isolated vertices are removed. In this paper we…

math.CO2021

On Perfectness of Annihilating-Ideal Graph of

Manideepa Saha, Sucharita Biswas, Angsuman Das

The annihilating-ideal graph of a commutative ring with unity is defined as the graph with the vertex set is the set of all non-zero ideals with non-zero annih…

math.GR2021★ 11 cited

On Co-Maximal Subgroup Graph of a Group

Angsuman Das, Manideepa Saha, Saba Al-Kaseasbeh

The co-maximal subgroup graph of a group is a graph whose vertices are non-trivial proper subgroups of and two vertices and are adjacent if . In this p…

math.CO2020

Determining Number of Kneser Graphs: Exact Values and Improved Bounds

Angsuman Das, Hiranya Kishore Dey

The determining number of a graph is the minimum cardinality of a set such that pointwise stabilizer of under the action of is trivial. In t…

math.CO2020★ 1 cited

A Family of Tetravalent Half-transitive Graphs

Sucharita Biswas, Angsuman Das

In this paper, we introduce a new family of graphs, . We show that it is an infinite family of tetravalent half-transitive Cayley graphs. Apart from that, we determine some…

math.CO2019★ 2 cited

Classification of Cayley Rose Window Graphs

Angsuman Das, Arnab Mandal

Rose window graphs are a family of tetravalent graphs, introduced by Steve Wilson. Following it, Kovacs, Kutnar and Marusic classified the edge-transitive rose window graphs and Do…

math.CO2018★ 4 cited

Triameter of Graphs

Angsuman Das

In this paper, we introduce and study a new distance parameter {\it triameter} of a connected graph , which is defined as and is denot…

math.CO2017★ 12 cited

Partial Domination in Graphs

Angsuman Das

Let be a graph. For some with , a subset of is said to be a -partial dominating set if . The size of a smallest such is cal…

math.CO2017★ 3 cited

Subspace Sum Graph of a Vector Space

Angsuman Das

In this paper we introduce a graph structure, called subspace sum graph on a finite dimensional vector space where the vertex set is the coll…

math.GM2016★ 3 cited

On Perfectness of Intersection Graph of Ideals of

Angsuman Das

In this paper, we characterize the positive integers for which intersection graph of ideals of is perfect.

math.GM2015★ 48 cited

On Non-Zero Component Graph of Vector Spaces over Finite Fields

Angsuman Das

In this paper, we study non-zero component graph on a finite dimensional vector space over a finite field . We show that the graph is Hamil…

math.GM2015★ 61 cited

Non-Zero Component Graph of a Finite Dimensional Vector Space

Angsuman Das

In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination numb…

cs.CR2011★ 50 cited

An efficient multi-use multi-secret sharing scheme based on hash function

Angsuman Das, Avishek Adhikari

In this paper, a renewable, multi-use, multi-secret sharing scheme for general access structure based on one-way collision resistant hash function is presented in which each partic…