Quasi-kernels and quasi-sinks in infinite graphs

Details Quasi-kernels and quasi-sinks in infinite graphs Quasi-kernels and quasi-sinks in infinite graphs

2007-12-05

arxiv.org/abs/0712.0663v1

Mathematics

Combinatorics

Scientific paper

Given a directed graph G=(V,E) an independent set A of the vertices V is called quasi-kernel (quasi-sink) iff for each point v there is a path of length at most 2 from some point of A to v (from v to some point of A). Every finite directed graph has a quasi-kernel. The plain generalization for infinite graphs fails, even for tournaments. We investigate the following conjecture here: for any digraph G=(V,E) there is a a partition (V_0,V_1) of the vertex set such that the induced subgraph G[V_0] has a quasi-kernel and the induced subgraph G[V_1] has a quasi-sink.

Affiliated with

Also associated with

No associations

Rating

Quasi-kernels and quasi-sinks in infinite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quasi-kernels and quasi-sinks in infinite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-kernels and quasi-sinks in infinite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310386