Read More
Date: 17-3-2022
![]()
Date: 24-2-2022
![]()
Date: 1-4-2022
![]() |
Let be a finite, connected, undirected graph with graph diameter
and graph distance
between vertices
and
. A radio labeling of a graph
is labeling using distinct nonnegative integers such that
for every pair of distinct vertices
,
in the vertex set of
. Then the radio number of
, commonly denoted
, is the smallest integer
such that
has a radio labeling
with
.
The smallest integer such that
has a radio labeling
with
is known as the radio number of
, commonly denoted
.
Define . A radio labeling
of
is optimal if
.
|
|
"إنقاص الوزن".. مشروب تقليدي قد يتفوق على حقن "أوزيمبيك"
|
|
|
|
|
الصين تحقق اختراقا بطائرة مسيرة مزودة بالذكاء الاصطناعي
|
|
|
|
|
قسم شؤون المعارف ووفد من جامعة البصرة يبحثان سبل تعزيز التعاون المشترك
|
|
|