We show that the geodetic number of proper interval graphs can be computed in polynomial time. This problem is NP-hard on chordal graphs and on bipartite weakly chordal graphs. Only an upper bound on the geodetic number of proper interval graphs has been known prior to our result.
机构:
Govt Arts Coll Women, Sivagangai, Tamil Nadu, IndiaGovt Arts Coll Women, Sivagangai, Tamil Nadu, India
Bhanumathi, M.
Niroja, R.
论文数: 0引用数: 0
h-index: 0
机构:
Bharathidasan Univ, Kalaignar Karunanidhi Govt Arts Coll Women Autono, Pudukkottai, Tamil Nadu, IndiaGovt Arts Coll Women, Sivagangai, Tamil Nadu, India
Niroja, R.
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS,
2022,
33
: 73
-
96