‪SAIKAT PAL‬ - ‪Google Scholar‬

Buat profil saya

Dikutip oleh

	Semua	Sejak 2020
Kutipan	31	31
indeks-h	3	3
indeks-i10	1	1

0

10

5

2020202120222023202420253 6 2 9 6 4

Pengarang bersama

Dinabandhu PradhanAssociate Professor, Department of Mathematics and Computing, IIT (ISM), DhanbadEmail yang diverifikasi di iitism.ac.in
Michael A. HenningProfessor of Mathematics, University of JohannesburgEmail yang diverifikasi di uj.ac.za

SAIKAT PAL

SAIKAT PAL

Ph.D., Department of Mathematics & Computing, IIT(ISM) Dhanbad, Dhanbad, India

Email yang diverifikasi di am.ism.ac.in

Graph Theory Graph Algorithms


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Algorithm and hardness results on hop domination in graphs MA Henning, S Pal, D Pradhan Information Processing Letters 153, 105872, 2020	17	2020
The semitotal domination problem in block graphs MA Henning, S Pal, D Pradhan Discussiones Mathematicae Graph Theory 42 (1), 231-248, 2021	7	2021
An time algorithm for computing a minimum semitotal dominating set in an interval graph D Pradhan, S Pal Journal of Applied Mathematics and Computing 66, 733-747, 2021	4	2021
Hop domination in chordal bipartite graphs. MA Henning, S Pal, D Pradhan Discussiones Mathematicae: Graph Theory 43 (3), 2023	2	2023
The strong domination problem in block graphs and proper interval graphs S Pal, D Pradhan Discrete Mathematics, Algorithms and Applications 11 (06), 1950063, 2019	1	2019

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–5