Sambhu Charan Barman

According to our database, Sambhu Charan Barman authored at least 7 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2024

Edge-vertex domination on interval graphs.

Amita Samanta Adhya, Sukumar Mondal, Sambhu Charan Barman

Discret. Math. Algorithms Appl., February, 2024

2022

Computation of diameter, radius and center of permutation graphs.

Shaoli Nandi, Sukumar Mondal, Sambhu Charan Barman

Discret. Math. Algorithms Appl., 2022

2021

Minimum r-neighborhood covering set of permutation graphs.

Amita Samanta Adhya, Sukumar Mondal, Sambhu Charan Barman

Discret. Math. Algorithms Appl., 2021

2019

An optimal algorithm to find minimum k-hop dominating set of interval graphs.

Sambhu Charan Barman, Madhumangal Pal, Sukumar Mondal

Discret. Math. Algorithms Appl., 2019

2014

Computation of a Tree 3-Spanner on Trapezoid Graphs.

Sambhu Charan Barman, Sukumar Mondal, Madhumangal Pal

CoRR, 2014

2010

The <i>k</i>-neighbourhood-covering problem on interval graphs.

Sambhu Charan Barman, Madhumangal Pal, Sukumar Mondal

Int. J. Comput. Math., 2010

A linear time algorithm to construct a tree 4-spanner on trapezoid graphs.

Sambhu Charan Barman, Sukumar Mondal, Madhumangal Pal

Int. J. Comput. Math., 2010