Second Neighborhood via First Neighborhood in Digraphs

نویسندگان

  • Guantao Chen
  • Jian Shen
چکیده

Let D be a simple digraph without loops or digons. For any v ∈ V (D), the first out-neighborhood N(v) is the set of all vertices with out-distance 1 from v and the second neighborhood N(v) of v is the set of all vertices with out-distance 2 from v. We show that every simple digraph without loops or digons contains a vertex v such that |N++(v)| ≥ γ|N+(v)|, where γ = 0.657298 . . . is the unique real root of the equation 2x + x − 1 = 0.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A remark on the second neighborhood problem

Seymour’s second neighborhood conjecture states that every simple digraph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. Such a vertex is said to have the second neighborhood property (SNP). We define ”good” digraphs and prove a statement that implies that every feed vertex of a tournament has the SNP. In the case of digraphs missi...

متن کامل

About the second neighborhood problem in tournaments missing disjoint stars

Let D be a digraph without digons. Seymour’s second neighborhood conjecture states that D has a vertex v such that d(v) ≤ d(v). Under some conditions, we prove this conjecture for digraphs missing n disjoint stars. Weaker conditions are required when n = 2 or 3. In some cases we exhibit two such vertices.

متن کامل

On Seymour's Second Neighborhood conjecture of m-free digraphs

This paper gives an approximate result related to Seymour’s Second Neighborhood conjecture, that is, for anym-free digraph G, there exists a vertex v ∈ V (G) and a real number λm such that d(v) ≥ λmd+(v), and λm → 1 while m → +∞. This result generalizes and improves some known results in a sense. © 2017 Elsevier B.V. All rights reserved.

متن کامل

Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization

In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...

متن کامل

The Concept of Behavioral Setting and its Impact on Improving Environmental Quality Neighborhood Parks (Case Study: Shiraz SEKONJ Neighborhood Park)

Neighborhood parks are important as spaces of residential neighborhoods where part of the daily interactions of residents take place. Hence, the study of environmental quality of the behavioral settings in which they are formed can be considered a suitable indicator to measure environmental quality with behavioral patterns. In order to intervene or adopt strategies in the design and planning of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003