The Second Neighborhood Conjecture for some Special Classes of Graphs

08/07/2018
by   Suresh Dara, et al.
0

An oriented graph is a directed graph with no loops or digons. The second out-neighbors of a vertex u in an oriented graph are the vertices to which there exist directed paths of length 2 from u, but are not out-neighbors of u. The Second Neighborhood Conjecture, first stated by Seymour, asserts that in every oriented graph, there is a vertex which has at least as many second out-neighbors as out-neighbors. We prove that the conjecture is true for two special classes of oriented graphs. We first show that any oriented graph whose vertex set can be partitioned into an independent set and 2-degenerate graph satisfies the conjecture. Fidler and Yuster ["Remarks on the second neighborhood problem", Journal of Graph Theory, 55(3):208--220, 2007] showed that the conjecture is true for graphs obtained by removing a matching from a tournament. We improve this result by showing that for graphs that can be obtained by removing a matching from a tournament and contain no sink, there exist two vertices with as many second out-neighbors as out-neighbors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2022

Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P_4

An oriented graph is a digraph that does not contain a directed cycle of...
research
07/10/2023

Bounding the chromatic number of dense digraphs by arc neighborhoods

The chromatic number of a directed graph is the minimum number of induce...
research
07/03/2022

On the minimum number of arcs in k-dicritical oriented graphs

The dichromatic number (D) of a digraph D is the least integer k such th...
research
06/19/2023

On the minimum number of arcs in 4-dicritical oriented graphs

The dichromatic number χ⃗(D) of a digraph D is the minimum number of col...
research
05/27/2020

Counting graph orientations with no directed triangles

Alon and Yuster proved that the number of orientations of any n-vertex g...
research
04/04/2022

Homomorphisms of (n,m)-graphs with respect to generalised switch

An (n,m)-graph has n different types of arcs and m different types of ed...
research
05/01/2017

Vertex Nomination Via Local Neighborhood Matching

Consider two networks on overlapping, non-identical vertex sets. Given v...

Please sign up or login with your details

Forgot password? Click here to reset