The strong convexity spectra of grids

From MaRDI portal
Publication:2409510



Abstract: Let D be a connected oriented graph. A set SsubseteqV(D) is convex in D if, for every pair of vertices x,yinS, the vertex set of every xy-geodesic, (xy shortest directed path) and every yx-geodesic in D is contained in S. The convexity number, mcon(D), of a non-trivial oriented graph, D, is the maximum cardinality of a proper convex set of D. The strong convexity spectrum of the graph G, SSC(G), is the set mcon(D)colonDmisastrongorientationofG. In this paper we prove that the problem of determining the convexity number of an oriented graph is mathcalNP-complete, even for bipartite oriented graphs of arbitrary large girth, extending previous known results for graphs. We also determine SSC(PnBoxPm), for every pair of integers n,mge2.












This page was built for publication: The strong convexity spectra of grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409510)