Follow
Sambhu Charan Barman
Sambhu Charan Barman
Assistant Professor, Department of Mathematics, Shahid Matangini Hazra Govt. College for Women, West
Verified email at matanginicollege.ac.in
Title
Cited by
Cited by
Year
An efficient algorithm to find next-to-shortest path on trapezoid graphs
SC Barman
Advances in Applied Mathematical Analysis 2 (2), 97-107, 2007
232007
An efficient algorithm to find next-to-shortest path on permutation graphs
SC Barman, S Mondal, M Pal
Journal of Applied Mathematics and Computing 31, 369-384, 2009
192009
An optimal algorithm to find minimum -hop dominating set of interval graphs
SC Barman, M Pal, S Mondal
Discrete Mathematics, Algorithms and Applications 11 (02), 1950016, 2019
172019
Minimum 2-tuple dominating set of permutation graphs
SC Barman, S Mondal, M Pal
Journal of Applied Mathematics and Computing 43, 133-150, 2013
132013
A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
SC Barman, S Mondal, M Pal
International Journal of Computer Mathematics 87 (4), 743-755, 2010
102010
The k-neighbourhood-covering problem on interval graphs
SC Barman, M Pal, S Mondal
International Journal of Computer Mathematics 87 (9), 1918-1935, 2010
82010
Edge-vertex domination on interval graphs
A Samanta Adhya, S Mondal, S Charan Barman
Discrete Mathematics, Algorithms and Applications 16 (02), 2350015, 2024
62024
Computation of a tree 3-spanner on trapezoid graphs
SC Barman, S Mondal, M Pal
arXiv preprint arXiv:1407.8132, 2014
62014
An Optimal Algorithm to Find Minimum k-hop Connected Dominating Set of Permutation Graphs
A Samanta Adhya, S Mondal, SC Barman
Asian-European Journal of Mathematics, 2020
5*2020
Vertex betweenness centrality of corona graphs and unicyclic graphs
S Nandi, S Mondal, SC Barman
Journal of Mathematical Extension 17, 2023
22023
Closeness centrality of friendship and lollipop graphs
SC Barman
Innovation of Multidisciplinary Research in Present and Future Time 4, 30-35, 2023
22023
Computation of diameter, radius and center of permutation graphs
S Nandi, S Mondal, SC Barman
Discrete Mathematics, Algorithms and Applications 14 (08), 2250039, 2022
22022
Edge-vertex domination of acyclic trapezoid graphs: Algorithm and complexity
AS Adhya, SC Barman
Uzbek Mathematical Journal 68 (1), 2024
12024
Computation of minimum d-hop connected dominating set of trees in O (n) time
SC Barman, AS Adhya, S Mondal, J Dayap
Journal of Algebra Combinatorics Discrete Structures and Applications, 133-147, 2022
12022
An Optimal Algorithm to Find Next-to-Shortest Path between Two Vertices of Cactus Graphs
SC Barman, M Pal, S Mondal
12019
Minimum Vertex-Edge Dominating Set of Permutation Graphs
A Samanta Adhya, S Mondal, SC Barman
Discrete Mathematics, Algorithms and Applications, 2025
2025
Center of Trapezoid Graph: Application in Selecting Center Location to Set up a Private Hospital
S Nandi, S Mondal, S Samanta, SC Barman, L Mrsic, A Kalampakas
Mathematics 13 (5), 885, 2025
2025
Closeness Centrality of Corona Product between well-known Graph and General Graph
S Nandi, S Mondal, SC Barman
Journal of Mathematical Extension 18, 2024
2024
Minimum -neighborhood covering set of permutation graphs
AS Adhya, S Mondal, SC Barman
Discrete Mathematics, Algorithms and Applications 13 (06), 2150081, 2021
2021
An optimal algorithm for computing minimum -hop dominating set of permutation graphs
S Barman, M Pal, S Mondal
Serdica Mathematical Journal 46 (1), 43–60-43–60, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20