A Steiner Problem in Coxeter Graph Which is NP ? Complete

Dr. G. Nirmala, C. Sujatha

Abstract: Our objects in this work is to obtain complexity theory, a specific problem known as Steiner problem in Coxeter graph which is NP complete and also it is worth mentioning that our result every full component of a Steiner tree contains almost 4 terminals involved therein.

Keywords: Steiner tree, satisfiability, NP-complete, Coxeter graph