2 citations · 7 across the 10 of their papers we have counts for
12 papers
Algorithmic study of -transitivity of graphs
Subhabrata Paul, Kamal Santra
Let be a graph where and are the vertex and edge sets, respectively. For two disjoint subsets and of , we say \emph{dominates} if every vertex…
A Direct Construction of Optimal Symmetrical Z-Complementary Code Sets of Prime Power Lengths
Praveen Kumar, Sudhan Majhi, Subhabrata Paul
This paper presents a direct construction of an optimal symmetrical Z-complementary code set (SZCCS) of prime power lengths using a multi-variable function (MVF). SZCCS is a natura…
Transitivity on subclasses of chordal graphs
Subhabrata Paul, Kamal Santra
Let be a graph, where and are the vertex and edge sets, respectively. For two disjoint subsets and of , we say \textit{dominates} if every ver…
A Direct Construction of Cross Z-Complementary Sets with Flexible Lengths and Large Zero Correlation Zone
Praveen Kumar, Sudhan Majhi, Subhabrata Paul
This letter proposes a direct construction for cross Z-complementary sets (CZCSs) with flexible lengths and a large zero correlation zone (ZCZ). CZCS is an extension of the cross Z…
A Direct Construction of Cross Z-Complementary Sequence Sets with Large Set Size
Praveen Kumar, Sudhan Majhi, Subhabrata Paul
This letter presents a direct construction of cross Z-complementary sequence sets (CZCSSs), whose aperiodic correlation sums exhibit zero correlation zones at both the front-end an…
Transitivity on subclasses of bipartite graphs
Subhabrata Paul, Kamal Santra
Let be a graph where and are the vertex and edge set, respectively. For two disjoint subsets and , we say dominates if every vertex of is adja…
A Direct Construction of GCP and Binary CCC of Length Non Power of Two
Praveen Kumar, Sudhan Majhi, Subhabrata Paul
Golay complementary pairs (GCPs) and complete complementary codes (CCCs) have found a wide range of practical applications in coding, signal processing and wireless communication d…
On vertex-edge and independent vertex-edge domination
Subhabrata Paul, Keshav Ranjan
Given a graph , a vertex ve-dominates all edges incident to any vertex of . A set is a ve-dominating set if for all edges , the…
Grid Obstacle Representation of Graphs
Arijit Bishnu, Arijit Ghosh, Rogers Mathew +2
The grid obstacle representation, or alternately, -obstacle representation of a graph is an injective function and a set of point o…
Algorithmic aspects of disjunctive domination in graphs
B. S. Panda, Arti Pandey, S. Paul
For a graph , a set is called a \emph{disjunctive dominating set} of if for every vertex , is either adjacent to a vertex of …
Uniformity of point samples in metric spaces using gap ratio
Arijit Bishnu, Sameer Desai, Arijit Ghosh +2
Teramoto et al. defined a new measure called the gap ratio that measures the uniformity of a finite point set sampled from , a bounded subset of . We generali…
Linear kernels for k-tuple and liar's domination in bounded genus graphs
Arijit Bishnu, Arijit Ghosh, Subhabrata Paul
A set is called a -tuple dominating set of a graph if for all , where denotes the closed neighbo…