The strong convexity spectra of grids
From MaRDI portal
Publication:2409510
Abstract: Let be a connected oriented graph. A set is convex in if, for every pair of vertices , the vertex set of every -geodesic, ( shortest directed path) and every -geodesic in is contained in . The convexity number, , of a non-trivial oriented graph, , is the maximum cardinality of a proper convex set of . The strong convexity spectrum of the graph , , is the set . In this paper we prove that the problem of determining the convexity number of an oriented graph is -complete, even for bipartite oriented graphs of arbitrary large girth, extending previous known results for graphs. We also determine , for every pair of integers .
Recommendations
Cites work
- Convexity in oriented graphs
- scientific article; zbMATH DE number 4050423 (Why is no real title available?)
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- On the convexity number of graphs
- On the hull number of some graph classes
- Some remarks on the convexity number of a graph
- Some remarks on the geodetic number of a graph
- The convexity number of a graph
- The convexity spectra of graphs
- The geodetic number of a graph
- The geodetic number of an oriented graph
- The hull number of a graph
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)