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 metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01185615
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 20, 2015 - 5:13:50 PM
Last modification on : Monday, May 18, 2020 - 4:50:33 PM
Document(s) archivé(s) le : Wednesday, April 26, 2017 - 10:10:38 AM

File

dmtcs-16-2-6.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01185615, version 1

Collections

Citation

Igor Ramos, Vinícius F. 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 (in progress) (2), pp.73--86. ⟨hal-01185615⟩

Share

Metrics

Record views

350

Files downloads

837