Sudeep Stephen

Orcid: 0000-0001-6216-0235

According to our database1, Sudeep Stephen authored at least 17 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023

2019
Minimum rank and zero forcing number for butterfly networks.
J. Comb. Optim., 2019

Zero forcing in iterated line digraphs.
Discret. Appl. Math., 2019

2018
A lower bound on the zero forcing number.
Discret. Appl. Math., 2018

2017
The metric dimension of the circulant graph C(n, \pm\{1, 2, 3, 4\}).
CoRR, 2017

On the Partition Dimension of Circulant Graphs.
Comput. J., 2017

On the Power Domination Number of de Bruijn and Kautz Digraphs.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
On the power domination number of de Bruijn and Kautz digraphs.
CoRR, 2016

Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree.
CoRR, 2016

Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs.
Comput. J., 2016

2015
On the Strong Metric Dimension of Tetrahedral Diamond Lattice.
Math. Comput. Sci., 2015

Power domination in certain chemical structures.
J. Discrete Algorithms, 2015

Resolving-power dominating sets.
Appl. Math. Comput., 2015

2014
On the partition dimension of a class of circulant graphs.
Inf. Process. Lett., 2014

On the metric dimension of circulant and Harary graphs.
Appl. Math. Comput., 2014

2012
Spectrum of Sierpiński triangles using MATLAB.
Proceedings of the 2012 Second International Conference on Digital Information and Communication Technology and it's Applications (DICTAP), 2012

Energy of grid based networks using MATLAB.
Proceedings of the 2012 Second International Conference on Digital Information and Communication Technology and it's Applications (DICTAP), 2012


  Loading...