Back to Top

About

Add Discription

Skills

Add Skills

Publication

FORCING SUBSETS FOR SOME TYPES OF CONVEX SETS IN A GRAPH

Let G be a connected graph. Given any two vertices u and v of G, the set ID[ ] u, consists of all those vertices lying on a longest v u-v path. A set S is a detour convex set if ID[u, for v]...

Scholar9 Profile ID

S9-072024-2302039

Publication
Publication

(1)

Review Request
Article Reviewed

(0)

Citations
Citations

(0)

Network
Network

(1)

Conferences
Conferences/Seminar

(0)