On oriented cliques with respect to push operation - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2017

On oriented cliques with respect to push operation

Abstract

An oriented graph is a directed graph without any directed cycle of length at most 2. An oriented clique is an oriented graph whose non-adjacent vertices are connected by a directed 2-path. To push a vertex v of a directed graph G is to change the orientations of all the arcs incident to v. A push clique is an oriented clique that remains an oriented clique even if one pushes any set of vertices of it. We show that it is NP-complete to decide if an undirected graph is the underlying graph of a push clique or not. We also prove that a planar push clique can have at most 8 vertices and provide an exhaustive list of planar push cliques.
Fichier principal
Vignette du fichier
BNS_DAM_v6.pdf (362.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01629946 , version 1 (07-11-2017)

Identifiers

Cite

Julien Bensmail, Soumen Nandi, Sagnik Sen. On oriented cliques with respect to push operation. Discrete Applied Mathematics, 2017, 232, pp.50 - 63. ⟨10.1016/j.dam.2017.07.037⟩. ⟨hal-01629946⟩
117 View
120 Download

Altmetric

Share

Gmail Facebook X LinkedIn More