5 papers
On the automorphisms of numerical power monoids
Anwita Bhowmik, Salvatore Tringali
Let be a numerical monoid, that is, a cofinite submonoid of (the non-negative integers under addition). Denote by the monoid obtained…
Divisible design graphs with selfloops
Anwita Bhowmik, Bart De Bruyn, Sergey Goryainov
We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical…
Divisible design graphs from symplectic graphs over rings with precisely three ideals
Anwita Bhowmik, Sergey Goryainov
In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.
Number of complete subgraphs of Peisert graphs and finite field hypergeometric functions
Anwita Bhowmik, Rupam Barman
For a prime and a positive integer , let . Let be a primitive element of the finite field . The Peisert graph is defi…
On a Paley-type graph on
Anwita Bhowmik, Rupam Barman
Let be a prime power such that . The Paley graph of order is the graph with vertex set as the finite field and edges defined as, is a…