A Broadcast “Rainbow”

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Girth, minimum degree, independence, and broadcast independence

An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...

متن کامل

An Investigation of LTE Broadcast

Broadcast and broadband communications have undoubt- edly become a part of today’s social life. Accessibility of content of interest to the audience at any place and at any time regardless of the type of content consumer device can have an effective contribution to the desire of the audience to use of the broadcast content. The HD and Ultra HD qualities, the desire for demand-driven application...

متن کامل

An Investigation of LTE Broadcast

Broadcast and broadband communications have undoubt- edly become a part of today’s social life. Accessibility of content of interest to the audience at any place and at any time regardless of the type of content consumer device can have an effective contribution to the desire of the audience to use of the broadcast content. The HD and Ultra HD qualities, the desire for demand-driven application...

متن کامل

A Rainbow Inverse Problem

We consider the radiative transfer equation (RTE) with reflection in a three-dimensional domain, infinite in two dimensions, and prove an existence result. Then, we study the inverse problem of retrieving the optical parameters from boundary measurements, with help of existing results by Choulli and Stefanov. This theoretical analysis is the framework of an attempt to model the color of the ski...

متن کامل

Rainbow Matchings and Rainbow Connectedness

Aharoni and Berger conjectured that every collection of n matchings of size n+1 in a bipartite graph contains a rainbow matching of size n. This conjecture is related to several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. There have been many recent partial results about the Aharoni-Berger Conjecture. The conjecture is known to hold when the matchings are m...

متن کامل

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


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

ژورنال

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

سال: 1922

ISSN: 0028-0836,1476-4687

DOI: 10.1038/110605a0