M-Convex set in G

Материал из WikiGrapp
Перейти к:навигация, поиск

\,m-Convex set in \,G\,m-выпуклое множество в графе \,G.

A path \,P in \,G is called \,m-path if the graph induced by the vertex set \,V(P) of \,P is \,P. A subset \,C of \,V(G) is said to be m-convex set if, for every pair of vertices \,x, y \in C, the vertex set of every \,x - y \,m-path is contained in \,C. The cardinality of a maximal proper \,m-convex set in \,G is the \,m-convexity number of \,G.

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.