1 citations · 2 across the 2 of their papers we have counts for
6 papers
(Independent) Roman Domination Parameterized by Distance to Cluster
Pradeesha Ashok, Gautam K. Das, Arti Pandey +2
Given a graph , a function is said to be a \emph{Roman Dominating function} (RDF) if for every with , there exists a vertex …
On -vertex-edge domination of graph
Debojyoti Bhattacharya, Subhabrata Paul
Let be a simple undirected graph. The open neighbourhood of a vertex in is defined as ; whereas the closed neighbourhood is defined…
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…
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…
-set problem in graphs
Arijit Bishnu, Kunal Dutta, Arijit Ghosh +1
A subset of a graph is a -set if every vertex is adjacent to at least but not more than vertices in D. The cardin…