The one - hop neighborhood of Paul Erdös

نویسندگان

  • Paul Erdös
  • Souvik Bhattacherjee
چکیده

The idea of the Erdös number was created by his fellow mathematicians as a humorous tribute to his enormous output as one of the most prolific modern writers of mathematical papers [1]. An Erdös number 1 is awarded to the person who has published at least one mathematical paper with the celebrated mathematician. Similarly, joint publications with someone with an Erdös number of 1 yield an Erdös number of 2. Erdös himself has the number 0. The Erdös number has gained prominence in scientific circles as one of the important metrics of adjudging mathematical prowess of a mathematician.

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

ثبت نام

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

منابع مشابه

Neighborhood Cache for Mobile Ad-hoc Networks

Distributed cache data placement in ad-hoc networks enables higher performance and better quality of service for mobile users. Prior work in the area has focused much of its effort for minimizing the cost of data access within an adhoc network by using different strategies for data placement, replication, and data access. Formation of such networks in common work places requires support for und...

متن کامل

Parameterized Neighborhood-based Flooding for Ad Hoc Wireless Networks

Flooding is a simple routing technique that can be used to transmit data from one node to every other node in a network. The focus of this paper is to investigate improvements to flooding techniques used in ad hoc wireless networks. Recent work has focused on using topological information to reduce the number of broadcasts. The number of broadcasts necessary to flood the network was the major p...

متن کامل

On Hop Roman Domination in Trees

‎Let $G=(V,E)$ be a graph‎. ‎A subset $Ssubset V$ is a hop dominating set‎‎if every vertex outside $S$ is at distance two from a vertex of‎‎$S$‎. ‎A hop dominating set $S$ which induces a connected subgraph‎ ‎is called a connected hop dominating set of $G$‎. ‎The‎‎connected hop domination number of $G$‎, ‎$ gamma_{ch}(G)$,‎‎‎ ‎is the minimum cardinality of a connected hop‎‎dominating set of $G$...

متن کامل

Real-Time Routing Protocols for Wireless Sensor Networks

Developing real-time routing protocols under energy constraint is one of the key points for providing end-to-end delay guarantee in multi-hop wireless sensor networks. In this paper, we give, at first, an overview of the existing real-time routing protocols and point out some potential approaches to improve them. To enhance existing protocols, one way is to make routing decision based on multi-...

متن کامل

Ultra Smart Counter Based Broadcast Using Neighborhood Information in MANETS

Broadcasting protocol heavily affects performance of Mobile Ad Hoc Networks (MANET). Counter-based scheme can reduce the number of rebroadcasts, and as a result reduce Broadcast Storm Problem. Previously fixed counter-based broadcasting was used irrespective of node/network status; this research demonstrates that dynamically adjusting the counter-based to take into account neighborhood informat...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2013