Skip to Main content Skip to Navigation
Journal articles

Complexity aspects of the computation of the rank of a graph

Abstract : We consider the P₃-convexity on simple undirected graphs, in which a set of vertices S is convex if no vertex outside S has two or more neighbors in S. The convex hull H(S) of a set S is the smallest convex set containing S as a subset. A set S is a convexly independent set if v \not ∈ H(S\setminus \v\) for all v in S. The rank \rk(G) of a graph is the size of the largest convexly independent set. In this paper we consider the complexity of determining \rk(G). We show that the problem is NP-complete even for split or bipartite graphs with small diameter. We also show how to determine \rk(G) in polynomial time for the well structured classes of graphs of trees and threshold graphs. Finally, we give a tight upper bound for \rk(G), which in turn gives a tight upper bound for the Radon number as byproduct, which is the same obtained before by Henning, Rautenbach and Schäfer. Additionally, we briefly show that the problem is NP-complete also in the monophonic convexity.
Document type :
Journal articles
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 5:13:50 PM
Last modification on : Tuesday, October 19, 2021 - 11:03:56 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 10:10:38 AM


Publisher files allowed on an open archive




Igor da Fonseca Ramos, Vinícius F. Dos Santos, Jayme L. Szwarcfiter. Complexity aspects of the computation of the rank of a graph. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 2 (2), pp.73--86. ⟨10.46298/dmtcs.2075⟩. ⟨hal-01185615⟩



Record views


Files downloads